普通数组的实现
package ArrayStack;
public class MyArray <E>{
private E []data;
private int size;
public MyArray(int size) {
data=(E[])new Object[size];
size=0;
}
public MyArray() {
this(10);
}
public void add(int index,E e) {
if(index>size||index<0) {
throw new IllegalArgumentException("下标越界");
}
if(size==data.length) {
resize(data.length*2);
}
for(int i=size-1;i>=index;i--) {
data[i+1]=data[i];
}
data[index]=e;
size++;
}
public void addLast(E e) {
add(size,e);
}
public void addFirst(E e) {
add(0,e);
}
public E removeIndex(int index) {
if(index>=size||index<0) {
throw new IllegalArgumentException("remove faile,index is illegal");
}
E res =data[index];
for(int i=index;i<size;i++) {
data[i]=data[i+1];
}
size--;
if(size==data.length/4&&data.length!=1) {
resize(data.length/2);
}
return res;
}
public E removeLast() {
return removeIndex(size-1);
}
public E removFirst() {
return removeIndex(0);
}
public int findIndex(int e) {
for(int i=0;i<size;i++) {
if(data[i].equals(e)) {
return i;
}
}
return -1;
}
public void set(int index ,E e) {
if(index>size||index<0) {
throw new IllegalArgumentException("set fail,index is Illgal");
}
data[index]=e;
}
public boolean contain(E e) {
for(int i=0;i<size;i++) {
if(data[i].equals(e)) {
return true;
}
}
return false;
}
public E getElement(int index) {
if(index>=size||index<0) {
throw new IllegalArgumentException("get index fail,index is illegal");
}
return data[index];
}
public int getIndex(int i) {
return findIndex(i);
}
public void resize(int newcapacity) {
E []newdata=(E[])new Object[newcapacity];
for(int i=0;i<size;i++) {
newdata[i]=data[i];
}
data=newdata;
}
public E getLast() {
return getElement(size-1);
}
public int getSize() {
return size;
}
public boolean isEmpty() {
return size==0;
}
@Override
public String toString() {
StringBuffer res=new StringBuffer();
res.append(String.format("Array:size=%d,capacity=%d\n", size,data.length));
res.append("[");
for(int i=0;i<size;i++) {
if(i==size-1) {
res.append(data[i]);
}else {
res.append(data[i]+",");
}
}
res.append("]");
return res.toString();
}
}