update

.gitignore

@@ -1,5 +1,4 @@
 *.class
-
 # Mobile Tools for Java (J2ME)
 .mtj.tmp/
 
@@ -14,3 +13,9 @@ hs_err_pid*
 #ide config
 .metadata
 .recommenders
+.idea/
+*.iml
+rebel.*
+.rebel.*
+
+target

group17/1204187480/code/homework/basic/pom.xml

@@ -0,0 +1,12 @@
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+    <artifactId>basic</artifactId>
+    <parent>
+        <groupId>com.coding</groupId>
+        <artifactId>parent</artifactId>
+        <version>1.0-SNAPSHOT</version>
+        <relativePath>../parent/pom.xml</relativePath>
+    </parent>
+
+</project>

group17/1204187480/code/homework/basic/src/main/java/com/coding/basic/ArrayList.java

@@ -0,0 +1,108 @@
+package com.coding.basic;
+
+import java.util.Arrays;
+
+public class ArrayList implements List {
+
+    private int size = 0;
+
+    private Object[] elementData = new Object[100];
+
+    private Iterator iterator = new ArrayListIterator();
+
+    private int length() {
+        return elementData.length;
+    }
+
+    private static final int ENLARGE_LENGTH = 100;
+
+    private Object[] enlarge(Object[] origin) {
+        return Arrays.copyOf(origin, origin.length + ENLARGE_LENGTH);
+    }
+
+    private void enLargeElementData() {
+        if (size == length()) {
+            elementData = enlarge(elementData);
+        }
+    }
+
+    public void add(Object o) {
+        enLargeElementData();
+        elementData[size] = o;
+        size++;
+    }
+
+    public void add(int index, Object o) {
+        checkForAdd(index);
+        enLargeElementData();
+        // 备份 index 处及后面的数据
+        Object[] elementsBehindIndex = backBehindElements(elementData, index);
+        // 给index处 设值
+        elementData[index] = o;
+        // 追加 备份的数据
+        appendElement(elementData, index, elementsBehindIndex);
+        size++;
+    }
+
+    private void appendElement(Object[] origin, int pos, Object[] append) {
+        System.arraycopy(append, 0, origin, pos, append.length);
+    }
+
+    private Object[] backBehindElements(Object[] elementData, int index) {
+        int backSize = size - index;
+        Object[] back = new Object[backSize];
+        System.arraycopy(elementData, index, back, 0, backSize);
+        return back;
+    }
+
+    public Object get(int index) {
+        checkIndex(index);
+        return elementData[index];
+    }
+
+    private void checkIndex(int index) {
+        if (index < 0 || index >= size) {
+            throw new ArrayIndexOutOfBoundsException(String.format("index=%s, size=%s", index, size));
+        }
+    }
+
+    private void checkForAdd(int index) {
+        if (index < 0 || index > size) {
+            throw new ArrayIndexOutOfBoundsException(String.format("index=%s, size=%s", index, size));
+        }
+    }
+
+    public Object remove(int index) {
+        checkIndex(index);
+        Object[] back = backBehindElements(elementData, index + 1);
+        System.arraycopy(back, 0, elementData, index, back.length);
+        Object ret = elementData[index];
+        elementData[index] = null;
+        size--;
+        return ret;
+    }
+
+    public int size() {
+        return size;
+    }
+
+    public Iterator iterator() {
+        return iterator;
+    }
+
+    private class ArrayListIterator implements Iterator {
+
+        int next = 0;
+
+        @Override
+        public boolean hasNext() {
+           return next < size;
+        }
+
+        @Override
+        public Object next() {
+            return elementData[next++];
+        }
+    }
+
+}

group17/1204187480/code/homework/basic/src/main/java/com/coding/basic/BinaryTreeNode.java

@@ -0,0 +1,32 @@
+package com.coding.basic;
+
+public class BinaryTreeNode {
+
+	private Object data;
+	private BinaryTreeNode left;
+	private BinaryTreeNode right;
+
+	public Object getData() {
+		return data;
+	}
+	public void setData(Object data) {
+		this.data = data;
+	}
+	public BinaryTreeNode getLeft() {
+		return left;
+	}
+	public void setLeft(BinaryTreeNode left) {
+		this.left = left;
+	}
+	public BinaryTreeNode getRight() {
+		return right;
+	}
+	public void setRight(BinaryTreeNode right) {
+		this.right = right;
+	}
+
+	public BinaryTreeNode insert(Object o){
+		return  null;
+	}
+
+}

group17/1204187480/code/homework/basic/src/main/java/com/coding/basic/Iterator.java

@@ -0,0 +1,7 @@
+package com.coding.basic;
+
+public interface Iterator {
+	public boolean hasNext();
+	public Object next();
+
+}

group17/1204187480/code/homework/basic/src/main/java/com/coding/basic/LinkedList.java

@@ -0,0 +1,125 @@
+package com.coding.basic;
+
+public class LinkedList implements List {
+
+    private Node head;
+    private int size = 0;
+
+    public void add(Object o) {
+        Node newNode = new Node(o, null);
+        if (head == null) {
+            head = newNode;
+        } else {
+            node(size - 1).next = newNode;
+        }
+        size++;
+    }
+
+    public void add(int index, Object o) {
+        checkForAdd(index);
+        if (index == size) {
+            add(o);
+        }else {
+            Node newNode = new Node(o, null);
+            if (index == 0){
+              addFirst(o);
+            } else {
+                Node preNode = node(index - 1);
+                Node now = preNode.next;
+                preNode.next = newNode;
+                newNode.next = now;
+                size++;
+            }
+        }
+
+    }
+
+    private Node node(int index) {
+        Node x = head;
+        for (int i = 0; i < index; i++) {
+            x = x.next;
+        }
+        return x;
+    }
+
+    public Object get(int index) {
+        checkIndex(index);
+        return node(index).data;
+    }
+
+    /**
+     * 让被删除的引用的持有者指向下一个节点
+     * @param index
+     * @return
+     */
+    public Object remove(int index) {
+        final Object ret;
+        checkIndex(index);
+        if (index == 0) {
+            Node removeNode = head;
+            ret = head.data;
+            head = removeNode.next;
+        } else {
+            Node pre = node(index - 1);
+            Node removeNode = pre.next;
+            ret = removeNode.data;
+            pre.next = removeNode.next;
+        }
+        size--;
+        return ret;
+    }
+
+    public int size() {
+        return size;
+    }
+
+    public void addFirst(Object o) {
+        head = new Node(o, head);;
+        size++;
+    }
+
+    public void addLast(Object o) {
+        add(o);
+    }
+
+    public Object removeFirst() {
+        if (size == 0){
+            return null;
+        }else {
+            return remove(0);
+        }
+    }
+
+    public Object removeLast() {
+        return remove(size - 1);
+    }
+
+    public Iterator iterator() {
+        return null;
+    }
+
+    private void checkIndex(int index) {
+        if (index < 0 || index >= size) {
+            throw new ArrayIndexOutOfBoundsException(String.format("index=%s, size=%s", index, size));
+        }
+    }
+
+    private void checkForAdd(int index) {
+        if (index < 0 || index > size) {
+            throw new ArrayIndexOutOfBoundsException(String.format("index=%s, size=%s", index, size));
+        }
+    }
+
+    private static class Node {
+        Object data;
+        Node next;
+
+        public Node() {
+        }
+
+        public Node(Object data, Node next) {
+            this.data = data;
+            this.next = next;
+        }
+    }
+}

group17/1204187480/code/homework/basic/src/main/java/com/coding/basic/List.java

@@ -0,0 +1,9 @@
+package com.coding.basic;
+
+public interface List {
+	public void add(Object o);
+	public void add(int index, Object o);
+	public Object get(int index);
+	public Object remove(int index);
+	public int size();
+}

group17/1204187480/code/homework/basic/src/main/java/com/coding/basic/Queue.java

@@ -0,0 +1,19 @@
+package com.coding.basic;
+
+public class Queue {
+
+	public void enQueue(Object o){		
+	}
+
+	public Object deQueue(){
+		return null;
+	}
+
+	public boolean isEmpty(){
+		return false;
+	}
+
+	public int size(){
+		return -1;
+	}
+}

group17/1204187480/code/homework/basic/src/main/java/com/coding/basic/Stack.java

@@ -0,0 +1,22 @@
+package com.coding.basic;
+
+public class Stack {
+	private ArrayList elementData = new ArrayList();
+
+	public void push(Object o){		
+	}
+
+	public Object pop(){
+		return null;
+	}
+
+	public Object peek(){
+		return null;
+	}
+	public boolean isEmpty(){
+		return false;
+	}
+	public int size(){
+		return -1;
+	}
+}

group17/1204187480/code/homework/basic/src/test/java/com/coding/api/ArrayListTest.java

@@ -0,0 +1,25 @@
+package com.coding.api;
+
+import org.junit.Test;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+/**
+ * Created by luoziyihao on 2/25/17.
+ */
+public class ArrayListTest {
+
+    private final Logger logger = LoggerFactory.getLogger(this.getClass());
+
+    @Test
+    public void testAdd(){
+        List<Object> list = new ArrayList<Object>(Arrays.asList(0, 1, 2, 3));
+        logger.info("list={}", list);
+        list.add(5, 2);
+        logger.info("list={}", list);
+    }
+}