工厂方法模式

Author: anxpp

src/com/anxpp/designpattern/factorymethod/LinkList.java

@@ -11,9 +11,14 @@ public Iterator<T> iterator() {
 	public boolean add(T t) {
 		if(size==0){
 			first = new Node<T>(t,null);
+			size++;
+			return true;
 		}
-		while(first.next!=null);
-		first.next = new Node<T>(t,null);
+		Node<T> node = first;
+		while(node.next!=null)
+			node = node.next;
+		node.next = new Node<T>(t,null);
+		size++;
 		return true;
 	}
 	//链表节点
@@ -33,7 +38,7 @@ private class MyIterator implements Iterator<T>{
 		}
 		@Override
 		public boolean hasNext() {
-			return next!=null;
+			return next != null;
 		}
 		@Override
 		public T next() {

src/com/anxpp/designpattern/factorymethod/TestUse.java

@@ -11,7 +11,7 @@ public static void main(String args[]){
 		}
 		//获得迭代器
 		Iterator<Integer> ai = array.iterator();
-		Iterator<Integer> li = array.iterator();
+		Iterator<Integer> li = link.iterator();
 		//遍历并输出
 		while(ai.hasNext())
 			System.out.print(ai.next());