java 简单数组_java 实现一个简单的数组

package com.clean.array;

public class HighArray {

private long[] array;

private int nElems;

public HighArray(int max) {

array = new long[max];

nElems = 0;

}

public boolean find(long key) {

int j;

for(j = 0; j < nElems; j ++) {

if(array[j]==key) {

break;

}

}

if(j == nElems) {

return false;

} else {

return true;

}

}

public void insert(long value) {

array[nElems] = value;

nElems ++;

}

public boolean delete(long value) {

int j;

for(j = 0; j < nElems; j ++) {

if(value == array[j]) {

break;

}

}

if(j == nElems) {

return false;

} else {

for(int k = j; k < nElems; k ++) {

array[k] = array[k + 1];

}

nElems --;

return true;

}

}

public void disPlay() {

for(int j =0; j < nElems; j ++) {

System.out.print(array[j] + " ");

}

System.out.println();

}

}

package com.clean.array;

public class HighArrayApp {

public static void main(String[] args) {

int max = 100;

HighArray highArray = new HighArray(max);

highArray.insert(200);

highArray.insert(100);

highArray.insert(400);

highArray.insert(300);

highArray.insert(100);

highArray.insert(60);

highArray.insert(11);

highArray.disPlay();

long key = 1100;

// long key = 300;

if(highArray.find(key)) {

System.out.println("find key = " + key);

} else {

System.out.println("can not find the key : " + key);

}

highArray.delete(200);

highArray.delete(100);

highArray.delete(11);

highArray.disPlay();

}

}