数组操作

public class MyArrays {
private int [] arr; //数组
private int element;

public  MyArrays(){    arr =new int [50];}//大小public  void Arrays(int max){    arr = new int [max];}//显示public void display (){    System.out.print("[");    for(int i = 0;i<element;i++){        System.out.print(arr[i]+" ");    }    System.out.println("]");}//有序数组public void add1(int value){    int i ;    for(i = 0;i<element;i++){        if(arr[i]>value){            break;        }    }    for(int j = element;j>i;j--){  //打开最后一个        arr[j]=arr[j-1];    }    arr[i]=value;    element++;  //自增一个}//增  public void add(int value){    arr[element] = value;    element++;}//删(索引)public void delet (int value){        for(int i = value;i<element;i++){        arr[i]=arr[i+1];    }    element--;}//改public void change(int oldvalue ,int newvalue ){    for(int i = 0;i<element;i++){        if(arr[i]==oldvalue){            arr[i]=newvalue;        }    }}//查（查值返索引）public  int  find(int value){    int index = 0 ;    for(int i = 0;i<arr.length;i++){        if(arr[i]==value){            index =i;        }    }    return index;}//二分法查找public int finde(int value){    int mid = 0;    int low = 0,pow = element;    while(true){    mid = (pow+low)/2;    if(arr[mid]==value){        return mid;        }else if(low>pow){            return -1;        }else{            if(arr[mid]>value){                pow = mid-1;            }else{                low = mid+1;            }        }    }}

}