java数据结构----数组篇

 1 package com.cn.higharray;
 2 /**
 3  * 对数组进行进一步封装，调用起来更方便
 4  * @author Administrator
 5  *
 6  */
 7 public class HighArray {
 8 private long [] a;
 9 private int nElems;
10 public HighArray(int max){
11     a = new long[max];
12     nElems = 0;
13 }
14 public boolean find(long key){
15     int j;
16     for(j = 0;j<nElems;j++)
17         if(a[j] == key)
18             break;
19     if (j == nElems)
20         return false;
21     else
22         return true;
23 }
24 public void insert(long value){
25     a[nElems] = value;
26     nElems++;
27 }
28 public boolean delete(long value){
29     int j ;
30     for(j = 0;j < nElems;j ++)
31         if (a[j] == value)
32             break;
33     if (j == nElems)
34         return false;
35     else{
36         for(int k = j;k < nElems;k ++)
37             a[k] = a[k+1];
38         nElems --;
39         return true;
40         }
41 }
42 public void display(){
43     for(int j = 0;j < nElems;j ++)
44         System.out.print(a[j]);
45     System.out.println("");
46 }
47 }