Merge pull request #14 from acd28705/master

完成热身作业，并完成了ArrayList的单元测试
zeyuanpinghe · Feb 26, 2017 · dd5393b · dd5393b
2 parents b5b6fac + 36e2c54
commit dd5393b
Show file tree

Hide file tree

Showing 9 changed files with 543 additions and 0 deletions.
diff --git a/group20/286166752/src/tests/wiki/liven/code/dataStructures/ArrayListTest.java b/group20/286166752/src/tests/wiki/liven/code/dataStructures/ArrayListTest.java
@@ -0,0 +1,89 @@
+package wiki.liven.code.dataStructures;
+
+import org.junit.Before;
+import org.junit.Test;
+
+
+/**
+ * Created by leven on 2017/2/26.
+ */
+public class ArrayListTest {
+
+    private ArrayList arrayList;
+
+
+    @Before
+    public void init(){
+        arrayList = new ArrayList();
+    }
+
+
+    @Test
+    public void add() throws Exception {
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        System.out.println(arrayList.toString());
+    }
+
+    @Test
+    public void add1() throws Exception {
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        System.out.println(arrayList.size());
+        arrayList.add(1,"星际游侠");
+        System.out.println(arrayList.toString());
+    }
+
+    @Test
+    public void get() throws Exception {
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        System.out.println(arrayList.get(1));
+    }
+
+    @Test
+    public void remove() throws Exception {
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        System.out.println(arrayList.remove(1));
+        System.out.println(arrayList.toString());
+    }
+
+    @Test
+    public void size() throws Exception {
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        arrayList.add("梅子黄时雨");
+        arrayList.add("行下一首歌");
+        arrayList.add("AmberTseng");
+        System.out.println(arrayList.size());
+    }
+
+}
diff --git a/group20/286166752/src/tests/wiki/liven/code/dataStructures/LinkedListTest.java b/group20/286166752/src/tests/wiki/liven/code/dataStructures/LinkedListTest.java
@@ -0,0 +1,35 @@
+package wiki.liven.code.dataStructures;
+
+import org.junit.Test;
+
+
+/**
+ * Created by leven on 2017/2/26.
+ */
+public class LinkedListTest {
+    @Test
+    public void add() throws Exception {
+
+    }
+
+    @Test
+    public void add1() throws Exception {
+
+    }
+
+    @Test
+    public void get() throws Exception {
+
+    }
+
+    @Test
+    public void remove() throws Exception {
+
+    }
+
+    @Test
+    public void size() throws Exception {
+
+    }
+
+}
diff --git a/group20/286166752/src/tests/wiki/liven/code/dataStructures/QueueTest.java b/group20/286166752/src/tests/wiki/liven/code/dataStructures/QueueTest.java
@@ -0,0 +1,24 @@
+package wiki.liven.code.dataStructures;
+
+import org.junit.Test;
+
+/**
+ * Created by leven on 2017/2/26.
+ */
+public class QueueTest {
+    @Test
+    public void queueEmpty() throws Exception {
+
+    }
+
+    @Test
+    public void enQueue() throws Exception {
+
+    }
+
+    @Test
+    public void deQueue() throws Exception {
+
+    }
+
+}
diff --git a/group20/286166752/src/tests/wiki/liven/code/dataStructures/StackTest.java b/group20/286166752/src/tests/wiki/liven/code/dataStructures/StackTest.java
@@ -0,0 +1,29 @@
+package wiki.liven.code.dataStructures;
+
+import org.junit.Test;
+
+/**
+ * Created by leven on 2017/2/26.
+ */
+public class StackTest {
+    @Test
+    public void push() throws Exception {
+
+    }
+
+    @Test
+    public void pop() throws Exception {
+
+    }
+
+    @Test
+    public void getTop() throws Exception {
+
+    }
+
+    @Test
+    public void stackEmpty() throws Exception {
+
+    }
+
+}
diff --git a/group20/286166752/src/wiki/liven/code/dataStructures/ArrayList.java b/group20/286166752/src/wiki/liven/code/dataStructures/ArrayList.java
@@ -0,0 +1,102 @@
+package wiki.liven.code.dataStructures;
+
+import java.util.Arrays;
+
+/**
+ * Created by leven on 2017/2/21.
+ */
+public class ArrayList implements List{
+
+    /**
+     * 列表中元素的个数
+     */
+    private int size = 0;
+    private int maxSize = 10;
+    /**
+     * 初始数组
+     */
+    private Object[] elementData = new Object[maxSize];
+
+    /**
+     * 在指定的位置i插入元素O
+     * 插入元素,判断当前列表中元素的个数,
+     * 当size==100,则需要扩张数组
+     * 当size<100,则使用初始数组完成插入操作
+     * 插入操作:
+     *  从最后一个元素开始,往后移动一位,直到到index为止.
+     * @param index
+     * @param o
+     */
+    @Override
+    public void add(int index, Object o) {
+        if(index<0||index>size-1)
+            throw new IndexOutOfBoundsException("数组下标越界异常。");
+        if (size==maxSize){
+            Object[] targt = new Object[++maxSize];
+            System.arraycopy(elementData,0,targt,0,elementData.length);
+            for (int j = targt.length-2;j>=index;j--){
+                targt[j+1] = targt[j];
+            }
+            targt[index] = o;
+            size++;
+            elementData = targt;
+        }else if(size<maxSize){
+            for (int j = size-1;j>=index;j--){
+                elementData[j+1] = elementData[j];
+            }
+            elementData[index] = o;
+            size++;
+        }
+    }
+
+    /**
+     * 追加元素
+     * @param o
+     */
+    @Override
+    public void add(Object o) {
+        if (size==maxSize){
+            Object[] targt = new Object[++maxSize];
+            System.arraycopy(elementData,0,targt,0,elementData.length);
+            targt[maxSize-1] = o;
+            size++;
+            elementData = targt;
+        }else if(size<maxSize){
+            elementData[size] = o;
+            size++;
+        }
+    }
+
+    @Override
+    public Object get(int index) {
+        if(index<0||index>size-1)
+            throw new IndexOutOfBoundsException("数组下标越界异常");
+        Object o= elementData[index];
+        return o;
+    }
+
+    @Override
+    public Object remove(int index) {
+        if (index<0||index>size-1)
+            throw new IndexOutOfBoundsException("数组下表越界异常");
+        Object temp = elementData[index];
+        for (int i = index;i<=size-1;i++){
+            elementData[i] = elementData[i+1];
+        }
+        size--;
+        return temp;
+    }
+
+    @Override
+    public int size() {
+        return size;
+    }
+
+
+    @Override
+    public String toString() {
+        return "ArrayList{" +
+                "elementData=" + Arrays.toString(elementData) +
+                '}';
+    }
+}