数据结构第一周作业

Jane Liu · Jane Liu · commit 97ae2d10eb7b · 2017-02-27T10:43:30.000+08:00
diff --git a/group10/364298692/article.md b/group10/364298692/article.md
@@ -0,0 +1,3 @@
+# ÿ����������
+## week01 ����������
+
diff --git a/group10/364298692/cs/.gitignore b/group10/364298692/cs/.gitignore
@@ -0,0 +1 @@
+/bin/
diff --git a/group10/364298692/cs/src/com/coding/basic/BinaryTreeNode.java b/group10/364298692/cs/src/com/coding/basic/BinaryTreeNode.java
@@ -26,7 +26,16 @@ public void setRight(BinaryTreeNode right) {
 	}
 	
 	public BinaryTreeNode insert(Object o){
-		return  null;
+		BinaryTreeNode node = new BinaryTreeNode();
+		node.data = o;
+		if(data.hashCode() > o.hashCode()){
+			this.right = node;
+		}else{
+			this.left = node;
+		}
+		return  this;
 	}
 	
+	
+	
 }
diff --git a/group10/364298692/cs/src/com/coding/basic/Queue.java b/group10/364298692/cs/src/com/coding/basic/Queue.java
@@ -2,18 +2,22 @@
 
 public class Queue {
 	
-	public void enQueue(Object o){		
+	private LinkedList linkedList;
+		
+	public void enQueue(Object o){
+		linkedList.addLast(o);
 	}
 	
 	public Object deQueue(){
-		return null;
+		Object obj = linkedList.removeFirst();
+		return obj;
 	}
 	
 	public boolean isEmpty(){
-		return false;
+		return linkedList.size() == 0;
 	}
 	
 	public int size(){
-		return -1;
+		return linkedList.size();
 	}
 }
diff --git a/group10/364298692/cs/src/com/coding/basic/Stack.java b/group10/364298692/cs/src/com/coding/basic/Stack.java
@@ -3,20 +3,23 @@
 public class Stack {
 	private ArrayList elementData = new ArrayList();
 	
-	public void push(Object o){		
+	public void push(Object o){
+		elementData.add(elementData.size(), o);
 	}
 	
 	public Object pop(){
-		return null;
+		Object obj = elementData.remove(elementData.size()-1);
+		return obj;
 	}
 	
 	public Object peek(){
-		return null;
+		Object obj = elementData.get(0);
+		return obj;
 	}
 	public boolean isEmpty(){
-		return false;
+		return elementData.size()==0;
 	}
 	public int size(){
-		return -1;
+		return elementData.size();
 	}
 }

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# 每周文章链接`
	`2`	`+## week01 计算机的组成`
	`3`	`+`
Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,16 @@ public void setRight(BinaryTreeNode right) {`
`26`	`26`	`}`
`27`	`27`
`28`	`28`	`public BinaryTreeNode insert(Object o){`
`29`		`- return null;`
	`29`	`+ BinaryTreeNode node = new BinaryTreeNode();`
	`30`	`+ node.data = o;`
	`31`	`+ if(data.hashCode() > o.hashCode()){`
	`32`	`+ this.right = node;`
	`33`	`+ }else{`
	`34`	`+ this.left = node;`
	`35`	`+ }`
	`36`	`+ return this;`
`30`	`37`	`}`
`31`	`38`
	`39`	`+`
	`40`	`+`
`32`	`41`	`}`
Original file line number	Diff line number	Diff line change
`@@ -2,18 +2,22 @@`
`2`	`2`
`3`	`3`	`public class Queue {`
`4`	`4`
`5`		`- public void enQueue(Object o){`
	`5`	`+ private LinkedList linkedList;`
	`6`	`+`
	`7`	`+ public void enQueue(Object o){`
	`8`	`+ linkedList.addLast(o);`
`6`	`9`	`}`
`7`	`10`
`8`	`11`	`public Object deQueue(){`
`9`		`- return null;`
	`12`	`+ Object obj = linkedList.removeFirst();`
	`13`	`+ return obj;`
`10`	`14`	`}`
`11`	`15`
`12`	`16`	`public boolean isEmpty(){`
`13`		`- return false;`
	`17`	`+ return linkedList.size() == 0;`
`14`	`18`	`}`
`15`	`19`
`16`	`20`	`public int size(){`
`17`		`- return -1;`
	`21`	`+ return linkedList.size();`
`18`	`22`	`}`
`19`	`23`	`}`
Original file line number	Diff line number	Diff line change
`@@ -3,20 +3,23 @@`
`3`	`3`	`public class Stack {`
`4`	`4`	`private ArrayList elementData = new ArrayList();`
`5`	`5`
`6`		`- public void push(Object o){`
	`6`	`+ public void push(Object o){`
	`7`	`+ elementData.add(elementData.size(), o);`
`7`	`8`	`}`
`8`	`9`
`9`	`10`	`public Object pop(){`
`10`		`- return null;`
	`11`	`+ Object obj = elementData.remove(elementData.size()-1);`
	`12`	`+ return obj;`
`11`	`13`	`}`
`12`	`14`
`13`	`15`	`public Object peek(){`
`14`		`- return null;`
	`16`	`+ Object obj = elementData.get(0);`
	`17`	`+ return obj;`
`15`	`18`	`}`
`16`	`19`	`public boolean isEmpty(){`
`17`		`- return false;`
	`20`	`+ return elementData.size()==0;`
`18`	`21`	`}`
`19`	`22`	`public int size(){`
`20`		`- return -1;`
	`23`	`+ return elementData.size();`
`21`	`24`	`}`
`22`	`25`	`}`