数组的倒序存放

int s[] ={1,3,5,7,9,11,13,15,17,19};int t;        for (int i = 0,j=s.length-1;i<j; i++,j--) {            t=s[i];            s[i]=s[j];            s[j]=t;         }        for (int i = 0; i < s.length; i++) {                System.out.print(s[i]+"  ");        }        System.out.println();

结果：
19 17 15 13 11 9 7 5 3 1