Merge pull request onlyliuxin#18 from YukoOshima/master

Greastate · web-flow · commit 6b30a5c499cc · 2017-02-25T23:19:05.000+08:00
hw
diff --git a/group08/125980622/first_hw/ArrayList.java b/group08/125980622/first_hw/ArrayList.java
@@ -0,0 +1,44 @@
+import java.util.Objects;
+
+public class ArrayList implements List {
+	
+	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;
+	}
+	
+	public Object get(int index){
+		return elementData[index];
+	}
+
+	public Object removeLast() {
+        return elementData[size--];
+    }
+	
+	public Object remove(int index){
+		Object temp = elementData[index];
+		for (int i = index; i < size - 1; i++) {
+			elementData[i] = elementData[i + 1];
+		}
+		size -= 1;
+		return temp;
+	}
+	
+	public int size(){
+		return size;
+	}
+	
+	public Iterator iterator(){
+		return new myIterator(this);
+	}
+	
+}
diff --git a/group08/125980622/first_hw/BinaryTreeNode.java b/group08/125980622/first_hw/BinaryTreeNode.java
@@ -0,0 +1,52 @@
+import com.sun.xml.internal.bind.v2.runtime.AttributeAccessor;
+
+public class BinaryTreeNode {
+	
+	private int data;
+	private BinaryTreeNode left;
+	private BinaryTreeNode right;
+	
+	public int getData() {
+		return data;
+	}
+	public void setData(int 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(int o){
+	    BinaryTreeNode returnNode = null;
+		if (data < o) {
+			if (right == null) {
+				right = new BinaryTreeNode(o, null, null);
+				returnNode = right;
+			} else {
+		        returnNode = right.insert(o);
+			}
+		} else if (data > o) {
+			if (left == null) {
+				returnNode = left = new BinaryTreeNode(o, null, null);
+			} else {
+				returnNode = left.insert(o);
+			}
+		}
+        return returnNode;
+    }
+
+	BinaryTreeNode (int initData, BinaryTreeNode initLeft, BinaryTreeNode initRight) {
+		data = initData;
+		left = initLeft;
+		right = initRight;
+	}
+}
diff --git a/group08/125980622/first_hw/Iterator.java b/group08/125980622/first_hw/Iterator.java
@@ -0,0 +1,4 @@
+public interface Iterator {
+	public boolean hasNext();
+	public Object next();
+}
diff --git a/group08/125980622/first_hw/LinkedList.java b/group08/125980622/first_hw/LinkedList.java
@@ -0,0 +1,90 @@
+public class LinkedList implements List {
+	
+	private Node head;
+	private int size = 0;
+	
+	public void add(Object o){
+		if (head == null) {
+			head = new Node(o);
+		} else {
+			Node pointer = head.next;
+			while (pointer.next != null) {
+				pointer = pointer.next;
+			}
+			pointer.next = new Node(o);
+		}
+		size++;
+	}
+	public void add(int index , Object o){
+		Node pointer = head;
+		for (int i = 0; i < index - 1; i++) {
+			pointer = pointer.next;
+		}
+		Node nNode = new Node(o, pointer.next);
+		pointer.next = nNode;
+		size++;
+	}
+	public Object get(int index){
+		Node pointer = head;
+		for (int i= 0; i < index; i++) {
+			pointer = pointer.next;
+		}
+		return pointer;
+	}
+	public Object remove(int index){
+		Node pointer = head;
+		for (int i = 0; i < index - 1; i++) {
+			pointer = pointer.next;
+		}
+		Node temp = pointer.next;
+		pointer.next = temp.next;
+		size--;
+		return temp;
+	}
+	
+	public int size(){
+		return size;
+	}
+	
+	public void addFirst(Object o){
+        head = new Node(o, head);
+	}
+	public void addLast(Object o){
+		Node pointer = head;
+		while (pointer.next != null) {
+			pointer = pointer.next;
+		}
+		pointer.next = new Node(o);
+	}
+	public Object removeFirst(){
+		Node temp = head;
+		head = head.next;
+		return temp;
+	}
+	public Object removeLast(){
+		Node pointer = head;
+		while (pointer.next.next != null) {
+			pointer = pointer.next;
+		}
+		Node temp = pointer.next;
+		pointer.next = null;
+		return temp;
+	}
+	public myIterator iterator(){
+		return new myIterator(this);
+	}
+	
+	
+	private static  class Node{
+		Object data;
+		Node next;
+		Node (Object o, Node n) {
+			data = o;
+			next = n;
+		}
+		Node (Object o) {
+			data = o;
+			next = null;
+		}
+	}
+}
diff --git a/group08/125980622/first_hw/List.java b/group08/125980622/first_hw/List.java
@@ -0,0 +1,7 @@
+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/group08/125980622/first_hw/Queue.java b/group08/125980622/first_hw/Queue.java
@@ -0,0 +1,21 @@
+
+public class Queue {
+
+    LinkedList queueList = new LinkedList();
+
+	public void enQueue(Object o){
+        queueList.addLast(o);
+	}
+	
+	public Object deQueue(){
+		return queueList.removeFirst();
+	}
+	
+	public boolean isEmpty(){
+        return queueList.size() <= 0;
+	}
+	
+	public int size(){
+        return queueList.size();
+	}
+}
diff --git a/group08/125980622/first_hw/Stack.java b/group08/125980622/first_hw/Stack.java
@@ -0,0 +1,24 @@
+public class Stack {
+	private ArrayList elementData = new ArrayList();
+
+	private int size = 0;
+	
+	public void push(Object o){
+		elementData.add(o);
+		size++;
+	}
+	
+	public Object pop(){
+		return elementData.remove(size);
+	}
+	
+	public Object peek(){
+		return elementData.get(size);
+	}
+	public boolean isEmpty(){
+		return size <= 0;
+	}
+	public int size(){
+		return size;
+	}
+}
diff --git a/group08/125980622/first_hw/myIterator.java b/group08/125980622/first_hw/myIterator.java
@@ -0,0 +1,37 @@
+import java.util.Objects;
+
+/**
+ * Created by Yusen Meng on 25/02/2017.
+ */
+public class myIterator implements Iterator {
+    int index = 0;
+    ArrayList _array = null;
+    LinkedList _list = null;
+    myIterator (LinkedList theList) {
+        _list = theList;
+    }
+    myIterator (ArrayList theArray) {
+        _array = theArray;
+    }
+    public boolean hasNext() {
+        boolean  result;
+        if (_array != null) {
+            result = index < _array.size();
+        } else {
+            result = index < _list.size();
+        }
+        return  result;
+    }
+
+    public Object next() {
+        Object returnValue;
+        if (_array != null) {
+            returnValue =  _array.get(index);
+            index++;
+        } else  {
+            returnValue = _list.get(index);
+            index++;
+        }
+        return returnValue;
+    }
+}
