From 1398fcd89dccef9efda7e8112cc1a11f20cb9d13 Mon Sep 17 00:00:00 2001
From: Eric <wanghuanxi@gmail.com>
Date: Sun, 26 Feb 2017 18:37:42 +0800
Subject: [PATCH] home work

---
 group12/251822722/ArrayList.java      | 87 +++++++++++++++++++++++++++
 group12/251822722/BinaryTreeNode.java | 35 +++++++++++
 group12/251822722/Iterator.java       |  6 ++
 group12/251822722/LinkedList.java     | 51 ++++++++++++++++
 group12/251822722/List.java           | 11 ++++
 group12/251822722/Queue.java          | 38 ++++++++++++
 group12/251822722/Stack.java          | 33 ++++++++++
 7 files changed, 261 insertions(+)
 create mode 100755 group12/251822722/ArrayList.java
 create mode 100755 group12/251822722/BinaryTreeNode.java
 create mode 100755 group12/251822722/Iterator.java
 create mode 100755 group12/251822722/LinkedList.java
 create mode 100755 group12/251822722/List.java
 create mode 100755 group12/251822722/Queue.java
 create mode 100755 group12/251822722/Stack.java

diff --git a/group12/251822722/ArrayList.java b/group12/251822722/ArrayList.java
new file mode 100755
index 0000000000..77b8052cc7
--- /dev/null
+++ b/group12/251822722/ArrayList.java
@@ -0,0 +1,87 @@
+import java.util.Arrays;
+
+public class ArrayList implements List {
+
+    private int size = 0;
+
+    private int index =0;
+
+    private Object[] elementData = new Object[100];
+
+    public void add(Object o) {
+        elementData[size] = o;
+        size = size+1;
+
+    }
+
+    public void add(int index, Object o) {
+
+        Object[] elementDataNew =null;
+        if(size<elementData.length+1){
+             elementDataNew = new Object[elementData.length];
+        }else {
+             elementDataNew = new Object[elementData.length+1];
+        }
+
+        for(int i =0;i<index;i++){
+            elementDataNew[i]=elementData[i];
+        }
+
+        elementDataNew[index]=o;
+
+        for(int j= index+1;j<elementData.length;j++){
+            elementDataNew[j]=elementData[j];
+        }
+        elementData = elementDataNew;
+        size=size+1;
+
+        return;
+
+    }
+
+    public Object get(int index) {
+        return elementData[index];
+    }
+
+    public Object remove(int index) {
+        Object[]  elementDataNew = new Object[elementData.length+1];
+
+        for(int i =0;i<index;i++){
+            elementDataNew[i]=elementData[i];
+        }
+
+        for(int j= index+1;j<elementData.length;j++){
+            elementDataNew[j-1]=elementData[j];
+        }
+
+        elementData = elementDataNew;
+        size=size-1;
+         return this;
+    }
+
+    public int size() {
+        return size;
+    }
+
+    public Iterator iterator() {
+        return null;
+    }
+
+    @Override
+    public String toString() {
+        return "ArrayList{" +
+                "size=" + size +
+                ", index=" + index +
+                ", elementData=" + Arrays.toString(elementData) +
+                '}';
+    }
+
+    public static void main(String[] args) {
+        ArrayList arrayList = new ArrayList();
+        arrayList.add(1);
+        arrayList.add(2,2);
+        arrayList.remove(0);
+
+        arrayList.toString();
+    }
+}
diff --git a/group12/251822722/BinaryTreeNode.java b/group12/251822722/BinaryTreeNode.java
new file mode 100755
index 0000000000..42555b1cec
--- /dev/null
+++ b/group12/251822722/BinaryTreeNode.java
@@ -0,0 +1,35 @@
+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;
+    }
+
+}
diff --git a/group12/251822722/Iterator.java b/group12/251822722/Iterator.java
new file mode 100755
index 0000000000..dfb39722c0
--- /dev/null
+++ b/group12/251822722/Iterator.java
@@ -0,0 +1,6 @@
+public interface Iterator {
+    public boolean hasNext();
+
+    public Object next();
+
+}
diff --git a/group12/251822722/LinkedList.java b/group12/251822722/LinkedList.java
new file mode 100755
index 0000000000..90018af9d6
--- /dev/null
+++ b/group12/251822722/LinkedList.java
@@ -0,0 +1,51 @@
+public class LinkedList implements List {
+
+    private Node head;
+
+    public void add(Object o) {
+
+    }
+
+    public void add(int index, Object o) {
+
+    }
+
+    public Object get(int index) {
+        return null;
+    }
+
+    public Object remove(int index) {
+        return null;
+    }
+
+    public int size() {
+        return -1;
+    }
+
+    public void addFirst(Object o) {
+
+    }
+
+    public void addLast(Object o) {
+
+    }
+
+    public Object removeFirst() {
+        return null;
+    }
+
+    public Object removeLast() {
+        return null;
+    }
+
+    public Iterator iterator() {
+        return null;
+    }
+
+
+    private static class Node {
+        Object data;
+        Node next;
+
+    }
+}
diff --git a/group12/251822722/List.java b/group12/251822722/List.java
new file mode 100755
index 0000000000..f1ef71d8d5
--- /dev/null
+++ b/group12/251822722/List.java
@@ -0,0 +1,11 @@
+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();
+}
diff --git a/group12/251822722/Queue.java b/group12/251822722/Queue.java
new file mode 100755
index 0000000000..40cae21c2f
--- /dev/null
+++ b/group12/251822722/Queue.java
@@ -0,0 +1,38 @@
+public class Queue {
+
+
+    private Object[] elementData = new Object[100];
+
+    private int size =0;
+
+    public void enQueue(Object o) {
+
+        elementData[size]=o;
+        size=size+1;
+    }
+
+    public Object deQueue() {
+
+        Object a = elementData[0];
+
+        Object[] newElementData = new Object[100];
+
+        for (int i = 1; i < elementData.length; i++)
+        {
+            newElementData[i-1]=elementData[i];
+        }
+        elementData=newElementData;
+        return a;
+    }
+
+    public boolean isEmpty() {
+        if(size==0){
+            return true;
+        }
+        return false;
+    }
+
+    public int size() {
+        return elementData.length;
+    }
+}
diff --git a/group12/251822722/Stack.java b/group12/251822722/Stack.java
new file mode 100755
index 0000000000..a45944296a
--- /dev/null
+++ b/group12/251822722/Stack.java
@@ -0,0 +1,33 @@
+
+public class Stack {
+    private Object[] elementData = new Object[100];
+
+    private int size =0;
+    public void push(Object o) {
+        elementData[size()]=o;
+        size=size+1;
+    }
+
+    public Object pop() {
+        Object a = elementData[size];
+        elementData[size]=null;
+        size = size-1;
+        return a;
+    }
+
+    public Object peek() {
+        return  elementData[size];
+    }
+
+    public boolean isEmpty() {
+
+        if(size==0){
+            return true;
+        }
+        return false;
+    }
+
+    public int size() {
+        return elementData.length;
+    }
+}