package com.day12;
/**
* 顺序表的实现
* @author linji
*
*/
public class MyList {
private int[] arr;
MyList(int[] arr){
this.arr = arr;
}
//插入操作,前插,
public int[] listInsert(int element, int index, int[] arr) {//1 <= index <= maxSize
int[] brr = new int[arr.length+1];
brr[index-1] = element;
for(int i=0; i<index-1;i++) {
brr[i] = arr[i];
}
for(int i=index-1; i< arr.length;i++) {
brr[i+1] = arr[i];
}
return brr;
}
//删除操作
public int[] listDelete(int index, int[] arr) {
int[] brr = new int[arr.length-1];
for(int i=0; i<index-1; i++) {
brr[i] = arr[i];
}
for(int i = index-1; i<arr.length-1; i++) {
brr[i] = arr[i+1];
}
return brr;
}
public static void main(String[] args) {
int[] arr = {3, 5, 7, 8};
MyList mylist = new MyList(arr);
int[] brr = mylist.listInsert(12, 2, arr);
for(int l : brr) {
System.out.print(l+"\t");
}
System.out.println();
int[] crr = mylist.listDelete(2,brr);
for(int l : crr) {
System.out.print(l+"\t");
}
}
}