一维数组的遍历、添加、删除、位置移动的实例

/**
* 数组处理算法
* 一维数组中元素的增加，删除，元素间的位置变化描述
*
*/
public class Arr{
public static void main(String[] args){
int [] arr = new int[15];
arr[0] = 11;
arr[1] = 22;
arr[2] = 33;
arr[3] = 44;
arr[4] = 55;
arr[5] = 66;
arr[6] = 77;
arr[7] = 88;
arr[8] = 99;
int len = 9;
int lenx = 8;

new Arr().bianli(arr, len);
// new Arr().deleteS(0, arr, 66, len);
// new Arr().insertS(arr, 0, 1, 88, lenx);
new Arr().moveS(0, 0, arr, 0, 1, 8, lenx);
}

// -----------------------------------------------------------------
// 遍历
public void bianli(int[] a, int n){
for(int i = 0; i < n; i++){
System.out.print(a[i] + " ");
}
System.out.println("/n");
}
// -----------------------------------------------------------------
// 删除
public void deleteS(int str, int[] a, int ss, int nn){
for(str = 0; str < nn; str++){
if(a[str] == ss){
break;
}
}
System.out.print("删除了" + a[str] + "之后的数组为：");
for(int k = str; k < nn - 1; k++){
a[k] = a[k+1];
}

for(int j = 0; j < nn - 1; j++){
System.out.print(a[j] + " ");
}
}
// -----------------------------------------------------------------
// 增加
public void insertS(int[] a, int str, int xbv, int value, int snx){
for(int i = str; i <= snx; i++){
if(xbv == i){
xbv = i;
break;
}
}
for(int i = snx + 1; i >= xbv; i--){ // 先移动，后赋值
a[i] = a[i - 1];
}
a[xbv] = value;
for(int i = 0; i <= snx + 1; i++){
System.out.print(a[i] + " ");
}
}
// -----------------------------------------------------------------
// 位置变化
public void moveS(int notefv, int notetv, int[] a, int strx, int firstx, int lastx, int zx){
for(strx = 0; strx <= zx; strx++){
if(strx == firstx){
notefv = a[firstx];
break;
}
}
for(strx = 0; strx <= zx; strx++){
if(strx == lastx){
notetv = a[lastx];
break;
}
}

a[lastx] = notefv;
a[firstx] = notetv;
for(int i = 0; i <= zx; i++){
System.out.print(a[i] + " ");
}
}

}