java 数组 反转 和排序

package com.gem.j2SE;
class Array{
private int temp[] = null;
private int foot = 0;  //用于保存下一个的记录点
public Array(int len) {
if(len>0){
      this.temp = new int[len];
}else
{
this.temp = new int[1];  //至少开辟一个空间
}
}
public boolean add(int i) {
if(this.foot<this.temp.length){
this.temp[this.foot] = i; //加入内容
this.foot++;  //改变失败
return true; //加入失败
}else{
return false;  // 加入失败
}
}
public int[] getArray(){
return this.temp;
}
}
class SortArray extends Array{
public SortArray(int len){
super(len);
}
public int [] getArray(){
java.util.Arrays.sort(super.getArray()); //排序操作
return super.getArray();
}

}
class ReverseArray extends Array{
public ReverseArray(int len){
super(len);
}
public int [] getArray(){
int rt[] = new int[super.getArray().length]; //根据大小开辟新数组
int count = rt.length-1;
for(int x=0;x<super.getArray().length;x++){
rt[count] = super.getArray()[x];
count--;
}
return rt;
}

}
public class ArrayDemo
{

public static void main(String[] args)
{
ReverseArray arr = new ReverseArray(6);
System.out.println(arr.add(3));
System.out.println(arr.add(21));
System.out.println(arr.add(31));
System.out.println(arr.add(32));
System.out.println(arr.add(33));
System.out.println(arr.add(35));
System.out.println(arr.add(67));
        print(arr.getArray());
}
public static void print(int i[]){
for(int x=0;x<i.length;x++){
System.out.print(i[x]+",");
}
}

}