`package com.ithelei.cn;
public class LowArray {
private long[] a;// 存儲數(shù)據(jù)的數(shù)組,容器
// 構造函數(shù)
public LowArray(int size) {// 參數(shù)代表數(shù)組的大小谬哀，里面能存多少個元素
a = new long[size];
}
//添加數(shù)據(jù)方法
public void setElem(int index, long value) {//下標索引,傳過來的數(shù)據(jù)
//操作數(shù)組
a[index]=value;
}
public long getElem(int index){
return a[index];
}
}
`
`
package com.ithelei.cn;
public class ArrayApp {
public static void main(String[] args) {
LowArray arr;
arr = new LowArray(100);
int nElems;// 元素個數(shù)
int j;// 循環(huán)
long searchKey;// 查找的數(shù)據(jù)項
arr.setElem(0, 77);// 第一個參數(shù)是位置
arr.setElem(1, 99);
arr.setElem(2, 44);
arr.setElem(3, 55);
arr.setElem(4, 22);
arr.setElem(5, 88);
arr.setElem(6, 11);
arr.setElem(7, 00);
arr.setElem(8, 66);
arr.setElem(9, 33);
nElems = 10;
// 顯示所有元素-------------
for (j = 0; j < nElems; j++)
System.out.print(arr.getElem(j) + " ");
System.out.println();
// 查找26
searchKey = 26;
for (j = 0; j < nElems; j++)
if (arr.getElem(j) == searchKey)break;
if (j == nElems)
System.out.println("沒有找到" + searchKey);
else
System.out.println("找到了" + searchKey);
// 刪除55
searchKey = 55;
for (j = 0; j < nElems; j++)
if (arr.getElem(j) == searchKey)break;
for (int k = j; k < nElems; k++)
arr.setElem(k, arr.getElem(k + 1));
nElems--;
// 顯示所有元素
for (j = 0; j < nElems; j++)
System.out.print(arr.getElem(j) + " ");
System.out.println();
}
}
`
