my first homework

diliuzuzhanghao · Mar 14, 2017 · e05a0fb · e05a0fb
1 parent 0cc5d25
commit e05a0fb
Show file tree

Hide file tree

Showing 3 changed files with 12 additions and 2 deletions.
diff --git a/group24/809203042/src/com/github/qq809203042/coding2017/basic/structures/MyArrayList.java b/group24/809203042/src/com/github/qq809203042/coding2017/basic/structures/MyArrayList.java
@@ -58,6 +58,8 @@ public Object remove(int index) {
 		}
 		Object removeElement = elementData[index];
 		moveForward(elementData,index+1,size-1,1);
+//		最后一位置为null；！！
+		elementData[size-1] = null;
 		size--;
 		return removeElement;
 	}

diff --git a/group24/809203042/src/com/github/qq809203042/coding2017/basic/structures/MyBinaryTree.java b/group24/809203042/src/com/github/qq809203042/coding2017/basic/structures/MyBinaryTree.java
@@ -51,9 +51,11 @@ private BinaryTreeNode add(BinaryTreeNode node, Integer key) {
 		}
 		Integer value = node.getValue();
 		if(value.compareTo(key) > 0){
-			node.left =add(node.left,key);
+			node.setLeft(add(node.left,key));
+
 		}else if(value.compareTo(key) < 0){
-			node.right=add(node.right,key);
+			node.setRight(add(node.right,key));
+
 		}
 		return node;
 	}

diff --git a/...809203042/src/com/github/qq809203042/coding2017/basic/structurestest/MyArrayListTest.java b/...809203042/src/com/github/qq809203042/coding2017/basic/structurestest/MyArrayListTest.java
@@ -1,4 +1,8 @@
 package com.github.qq809203042.coding2017.basic.structurestest;
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.Iterator;
+
 import com.github.qq809203042.coding2017.basic.structures.MyArrayList;
 
  /*
@@ -8,6 +12,8 @@
 public class MyArrayListTest {
 
 	public static void main(String[] args) {
+
+
 		MyArrayList mList = new MyArrayList();
 		mList.add(new String("hahah"));
 		mList.add(new String("heihei"));