Merge pull request #33 from wayss000/mygroup

提交迭代器
onlyliuxin · Feb 28, 2017 · dc9fbbd · dc9fbbd
2 parents 3798466 + 74c62f7
commit dc9fbbd
Show file tree

Hide file tree

Showing 3 changed files with 49 additions and 3 deletions.
diff --git a/group08/1144989424/firstPractice/readme.md b/group08/1144989424/firstPractice/readme.md
@@ -1,4 +1,5 @@
 ### 第一次作业：
 1. 实现ArrayList, LinkedList, Queue, Stack 
 2. 有余力的同学可以实现 BinaryTree 和Iterator
-3. 写一篇文章，建议: 描述CPU，内存， 硬盘，指令之间的关系。
+3. 写一篇文章，建议: 描述CPU，内存， 硬盘，指令之间的关系。
+* 我的文章地址：[浅谈CPU，内存， 硬盘，指令之间的关系](http://blog.csdn.net/qq1332479771/article/details/57597710)
diff --git a/group08/1144989424/firstPractice/src/basic/MyArrayList.java b/group08/1144989424/firstPractice/src/basic/MyArrayList.java
@@ -83,7 +83,30 @@ public int size(){
     }
 
     public MyIterator iterator(){
-        return null;
+        return new MyArrayListIterator(this);
+    }
+
+    private class MyArrayListIterator implements MyIterator{
+        private MyArrayList list = null;
+        private int index = 0;
+
+        private MyArrayListIterator(MyArrayList list){
+            this.list = list;
+        }
+
+        @Override
+        public boolean hasNext(){
+            if(index < size){
+                return true;
+            }
+            return false;
+        }
+
+        @Override
+        public Object next(){
+            return list.get(index++);
+        }
+
     }
 
     private void expandArray(){

diff --git a/group08/1144989424/firstPractice/src/basic/MyLinkedList.java b/group08/1144989424/firstPractice/src/basic/MyLinkedList.java
@@ -98,10 +98,32 @@ public Object removeLast(){
         size--;
         return deleteNode;
     }
+
     public MyIterator iterator(){
-        return null;
+        return new MyLinkedListIterator(this);
     }
 
+    private class MyLinkedListIterator implements MyIterator{
+        private MyLinkedList list = null;
+        private int index = 0;
+
+        private MyLinkedListIterator(MyLinkedList list){
+            this.list = list;
+        }
+
+        @Override
+        public boolean hasNext(){
+            if(index < size){
+                return true;
+            }
+            return false;
+        }
+
+        @Override
+        public Object next(){
+            return list.get(index++);
+        }
+    }
 
     private static class Node{
         Object data;