先附上代码,详细内容日后在更(嘻嘻)
数组封装的工具类:
package shuzu;
public class Array {
public int[] array; //声明数组
public int length=0;//声明数组的元素个数
//构造方法,传入最大长度
public Array(int max) {
array=new int[max];
}
//检测数组中是否包含某元素,若包含,返回下标,不存在返回-1
public int contains(int target) {
int index=-1;
for (int i = 0; i < length; i++) {
if (array[i]==target) {
index=i;
break;
}
}
return index;
}
//删除数组中的target元素,删除成功返回true,失败false
public boolean delete(int target) {
int index =-1;
if ((index=contains(target))!=-1) {
for (int i = index; i < length-1; i++) {
array[i]=array[i+1];
}
length--;
return true;
}else {
return false;
}
}
//向所有元素后添加元素
public void addLast(int e) {
if (length == array.length)
throw new IllegalArgumentException("数组已满");
array[length] = e;
length++;
}
//修改下标为index的元素,修改为target
public boolean update(int index,int target) {
for (int i = 0; i < length; i++) {
array[index]=target;
return true;
}
return false;
}
//to String
@Override
public String toString() {
StringBuilder res = new StringBuilder();
res.append(String.format("Array:length=%d, max=%d\n", length, array.length));
res.append('[');
for (int i = 0; i < length; i++) {
res.append(array[i]);
if (i != length - 1) {
res.append(",");
}
}
res.append(']');
return res.toString();
}
}
测试代码:
package shuzu;
public class ArrayTest {
public static void main(String[] args) {
Array array1=new Array(10);
for (int i = 1; i < 8; i++) {
array1.addLast(i);
}
System.out.println(array1);
int c=array1.contains(4);
System.out.println(array1);
System.out.println(c);
array1.update(2, 6);
System.out.println(array1);
array1.delete(2);
System.out.println(array1);
}
}
测试结果:
Array:length=7, max=10
[1,2,3,4,5,6,7]
Array:length=7, max=10
[1,2,3,4,5,6,7]
3
Array:length=7, max=10
[1,2,6,4,5,6,7]
Array:length=6, max=10
[1,6,4,5,6,7]