Merge pull request onlyliuxin#17 from MrXingmf/master

luoziyihao · web-flow · commit c24489ad9a44 · 2017-02-26T23:05:02.000+08:00
homework
diff --git a/group17/116665530/homework/src/com/coding/basic/MyArrayList.java b/group17/116665530/homework/src/com/coding/basic/MyArrayList.java
@@ -0,0 +1,41 @@
+package com.coding.basic;
+
+public class MyArrayList implements MyList {
+    private int size = 0;
+    private Object[] elementData = new Object[100];
+
+    public void add(Object o){
+        elementData[size++] = o;
+    }
+    public void add(int index, Object o){
+        for(int i = size; i > index; i--)
+        {
+            elementData[i] = elementData[i - 1];
+        }
+        elementData[index] = o;
+        size++;
+    }
+
+    public Object get(int index){
+            return elementData[index];
+    }
+
+    public Object remove(int index){
+        Object obj = elementData[index];
+        for(int i = index; i < size(); i++)
+        {
+            elementData[i] = elementData[i + 1];
+        }
+        size--;
+        return elementData;
+    }
+
+    public int size(){
+        return size;
+    }
+
+    public MyIterator myIterator(){
+        return null;
+    }
+
+}
diff --git a/group17/116665530/homework/src/com/coding/basic/MyBinaryTreeNode.java b/group17/116665530/homework/src/com/coding/basic/MyBinaryTreeNode.java
@@ -0,0 +1,30 @@
+package com.coding.basic;
+
+public class MyBinaryTreeNode {
+    private Object data;
+    private MyBinaryTreeNode left;
+    private MyBinaryTreeNode right;
+
+    public Object getData() {
+        return data;
+    }
+    public void setData(Object data) {
+        this.data = data;
+    }
+    public MyBinaryTreeNode getLeft() {
+        return left;
+    }
+    public void setLeft(MyBinaryTreeNode left) {
+        this.left = left;
+    }
+    public MyBinaryTreeNode getRight() {
+        return right;
+    }
+    public void setRight(MyBinaryTreeNode right) {
+        this.right = right;
+    }
+
+    public MyBinaryTreeNode insert(Object o){
+        return  null;
+    }
+}
diff --git a/group17/116665530/homework/src/com/coding/basic/MyIterator.java b/group17/116665530/homework/src/com/coding/basic/MyIterator.java
@@ -0,0 +1,6 @@
+package com.coding.basic;
+
+public interface MyIterator {
+    public boolean hasNext();
+    public Object next();
+}
diff --git a/group17/116665530/homework/src/com/coding/basic/MyLinkedList.java b/group17/116665530/homework/src/com/coding/basic/MyLinkedList.java
@@ -0,0 +1,45 @@
+package com.coding.basic;
+
+public class MyLinkedList implements MyList{
+    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 MyIterator iterator(){
+        return null;
+    }
+
+
+    private static  class Node{
+        Object data;
+        Node next;
+
+    }
+}
diff --git a/group17/116665530/homework/src/com/coding/basic/MyList.java b/group17/116665530/homework/src/com/coding/basic/MyList.java
@@ -0,0 +1,9 @@
+package com.coding.basic;
+
+public interface MyList {
+    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/group17/116665530/homework/src/com/coding/basic/MyQueue.java b/group17/116665530/homework/src/com/coding/basic/MyQueue.java
@@ -0,0 +1,32 @@
+package com.coding.basic;
+
+public class MyQueue {
+    private Object[] elementData;
+    private int elementCount;
+    private int head;
+    private int next;
+    public void enQueue(Object o){
+        elementData[next] = o;
+        elementCount++;
+        next++;
+    }
+
+    public Object deQueue(){
+        Object obj = elementData[head];
+        elementData[head] = null;
+        elementCount--;
+        head++;
+        return obj;
+    }
+
+    public boolean isEmpty(){
+        if(elementData.length==0){
+            return true;
+        }
+        return false;
+    }
+
+    public int size(){
+        return elementData.length;
+    }
+}
diff --git a/group17/116665530/homework/src/com/coding/basic/MyStack.java b/group17/116665530/homework/src/com/coding/basic/MyStack.java
@@ -0,0 +1,34 @@
+package com.coding.basic;
+
+public class MyStack {
+    Object[] elementData;
+    private int size;
+
+    public void push(Object o){
+        elementData[size++]=o;
+    }
+
+    public Object pop(){
+        if(size>0)
+        {
+            elementData[--size]=null;
+        }
+        return null;
+    }
+
+    public Object peek(){
+        if(elementData.length == 0){
+            return null;
+        }
+        return elementData[size - 1];
+    }
+    public boolean isEmpty(){
+        if(elementData.length == 0){
+            return true;
+        }
+        return false;
+    }
+    public int size(){
+        return elementData.length;
+    }
+}
