实现MyArrayList

最近重新在温习数据结构,然后用java实现一些常见的数据结构。第一个就是模仿java的ArrayList, 实现了一个MyArrayList,功能比较简单,实现也比较简单,直接看代码:

package com.matt;

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

public class MyArrayList<AnyType> implements Iterable<AnyType> {

	private static final int DEFAULT_CAPACITY = 10;
	
	private int theSize;
	private AnyType [] theItems;
	
	public MyArrayList(){
		doClear();
	}
	
	public void clear(){
		doClear();
	}
	
	private void doClear(){
		theSize = 0; 
		ensureCapacity(DEFAULT_CAPACITY);
	}
	public boolean isEmpty(){
		return size()==0;
	}
	
	public AnyType get(int idx){
		if(idx<0 || idx >= size()) throw new ArrayIndexOutOfBoundsException();
		return theItems[idx];
	}
	
	public AnyType set(int idx, AnyType newVal){
		if(idx<0 || idx >= size()) throw new ArrayIndexOutOfBoundsException();
		
		AnyType old = theItems[idx];
		theItems[idx] = newVal;
		return old;
	}
	
	private 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 int size() {
		return theSize;
	}

	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];
		theItems[idx] = x;
		
		theSize++;
	}
	
	public boolean add(AnyType x){
		add(size(),x);
		return true;
	}
	
	public AnyType remove(int idx){
		if(idx<0 || idx >= size()) throw new ArrayIndexOutOfBoundsException();
		AnyType old = theItems[idx];
		for(int i=idx;i<size()-1;i++)
			theItems[i] = theItems[i+1];
		theSize--;
		return old;
	}
	
	public String toString(){
		String l = "[";
		for(int i=0;i<size();i++){
			if(i<size()-1)
			l = l + theItems[i] + ",";
			else l = l + theItems[i] + "]";
		}
		
		return l;
	}
	
	@Override
	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++];
		}

		@Override
		public void remove() {
			MyArrayList.this.remove(--current);
			
		}
		
	}
	
	
	public static void main(String [] args){
		MyArrayList<String> lst = new MyArrayList<String>();
		lst.add("a");
		lst.add("b");
		lst.add("c");
		
		System.out.println(lst.size());
		lst.remove(1);
		System.out.println(lst);
		
	    Iterator<String> lstIter = lst.iterator();
	    while(lstIter.hasNext()){
	    	String str = lstIter.next();
	    	if(str.equals("b")) lstIter.remove();
	    }
	    System.out.println(lst);
	    
	}

}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值