【DataStructure&AlgorithmInJava】Ch02-HighArrayDemo

来源：互联网发布：360企业版软件管家编辑：程序博客网时间：2024/06/11 01:17

class HighArray{private int[] arr;private int nElems;HighArray(int size){  //1.build an given size array & elements #=0arr=new int[size];nElems=0;}public void insert(int value){ //2.insert starts at [0]this.arr[nElems]=value;nElems++;}public void delete(int Key){int i;for(i=0;i<nElems;i++)//find it, via traverse the Array{if (Key==arr[i])break;}for( ;i<nElems;i++)//move forward arr[i]=arr[i+1];}public int find(int Key){for(int i=0;i<nElems;i++){if (Key==arr[i])return i;}return -1;}public void print(){for(int i=0;i<nElems;i++)System.out.println("arr["+i+"]="+arr[i]);}}class HighArrayDemo{public static void main(String[] args){int maxSize=100;HighArray arr=new HighArray(maxSize);//----add-----arr.insert(66);arr.insert(77);arr.insert(99);arr.insert(88);arr.print();//----delete----arr.delete(77);arr.print();//----find-----int index=arr.find(99);System.out.println("index="+index);}}Comment:1.result gets a 0?2.insert doesn't have to traverse the array.

0 0