ArrayList的自我实现(数组实现方式)

package dataStructures.list;

public class AnyType {

}
package dataStructures.list;

import java.util.Iterator;
import java.util.NoSuchElementException;

public class MyArrayList<AnyType>{
	private static final int DEFAULT_CAPACITY=10;
	private int theSize;
	private AnyType[] theItems;
	
	MyArrayList(){
		ensureCapacity(DEFAULT_CAPACITY);
	}
	
	public int size() {
		return theSize;
	}
	
	public boolean isEmpty() {
		return size()==0;
	}
	
	public Object get(int idx) {
		if(idx<0 || idx>=size()) {
			throw new ArrayIndexOutOfBoundsException();
		}
		return theItems[idx];
	}
	
	public void ensureCapacity(int newCapacity) {
		if(newCapacity<theSize) {
			return;
		}
		AnyType[] old=theItems;
		theItems=(AnyType[])new Object[newCapacity];
		for (int i = 0; i < size(); i++) {
			theItems[i]=old[i];
		}
	}
	
	public boolean add(AnyType x) {
		add(size(),x);
		return true;
	}
	
	public void add(int idx,AnyType x) {
		if(theItems.length==size()) {
			ensureCapacity(size()*2+1);
		}
		for (int i = theSize; i > idx; i--) {
			theItems[i]=theItems[i-1];//从idx的位置开始往后把i-1的值赋值给i的值
		}
		theItems[idx]=x;//把idx的值赋值为x
		theSize++;
	}
	
	public AnyType remove(int idx) {
		AnyType removeItems=theItems[idx];
		for (int i = idx; i < size()-1; i++) {
			theItems[i]=theItems[i+1];
		}
		theSize--;
		return removeItems;
	}
	
	public Iterator<AnyType> iterator(){
		return new ArrayListIterator();
	}
	
	private class ArrayListIterator implements Iterator<AnyType>{
		private int current=0;
		@Override
		public boolean hasNext() {
			return current<size();
		}

		@Override
		public AnyType next() {
			if(!hasNext()) {
				throw new NoSuchElementException();
			}
			return theItems[current++];
		}
		
		public void remove() {
			MyArrayList.this.remove(--current);
		}
	}
	
	public static void main(String[] args) {
		MyArrayList list=new MyArrayList();
		list.add("haha");
		list.add("wawa");
		list.add("gaga");
		list.add("qaqa");
		list.add("eaea");
		list.add("rara");
		list.add("tata");
		System.out.println(list.get(0));
		System.out.println("remove: "+list.remove(0));
		System.out.println(list.get(0));
		Iterator iterator=list.iterator();
		while (iterator.hasNext()) {
			System.out.println("iterator: "+iterator.next());
			
		}
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值