Tennyson's task

group14/296933284/DataStructuresTest/.classpath

@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" path="src"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.junit.JUNIT_CONTAINER/4"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

group14/296933284/DataStructuresTest/.gitignore

@@ -0,0 +1,14 @@
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/
+/bin/

group14/296933284/DataStructuresTest/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>2017Learning</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

group14/296933284/DataStructuresTest/.settings/org.eclipse.jdt.core.prefs

@@ -0,0 +1,11 @@
+eclipse.preferences.version=1
+org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
+org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
+org.eclipse.jdt.core.compiler.compliance=1.8
+org.eclipse.jdt.core.compiler.debug.lineNumber=generate
+org.eclipse.jdt.core.compiler.debug.localVariable=generate
+org.eclipse.jdt.core.compiler.debug.sourceFile=generate
+org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
+org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
+org.eclipse.jdt.core.compiler.source=1.8

group14/296933284/DataStructuresTest/src/com/coding/basic/ArrayList.java

@@ -0,0 +1,147 @@
+package com.coding.basic;
+
+import java.util.Arrays;
+
+/**
+ * ArrayList ʵ�� ��14С�� 296933284
+ * 
+ * @author Tonnyson
+ *
+ */
+public class ArrayList implements List {
+
+	private int size;
+	private static final int DEFAULT_CAPACITY = 10;
+	private Object[] elementData;
+
+
+	public ArrayList() {
+		elementData = new Object[DEFAULT_CAPACITY];
+	}
+
+	public ArrayList(int initCapacity) {
+		elementData = new Object[initCapacity];
+	}
+
+	/**
+	 * ������ĩβ����ָ��Ԫ�أ����������������Զ���չΪԭ�����ȵ�����
+	 */
+	public void add(Object obj) {
+
+		ensureCapacityInternal(size);
+
+		elementData[size] = obj;
+		size++;
+	}
+
+
+	/**
+	 * �������ָ��λ�ò���Ԫ��
+	 */
+	public void add(int index, Object obj) {
+
+		rangCheckForAdd(index);
+		ensureCapacityInternal(size + 1);
+
+		for (int i = size - 1; i >= index; i--)
+			elementData[i + 1] = elementData[i];
+
+		elementData[index] = obj;
+		size++;
+	}
+
+	/**
+	 * ����������
+	 */
+	private void ensureCapacityInternal(int minCapacity) {
+		if (minCapacity - elementData.length > 0) {
+			int newCapacity = elementData.length * 2;
+			elementData = Arrays.copyOf(elementData, newCapacity);
+			// elementData = tempElementData;
+		}
+	}
+
+	/**
+	 * ������ add() �м�������±��Ƿ�Խ��
+	 */
+	private void rangCheckForAdd(int index) {
+		if (index > size || index < 0)
+			throw new IndexOutOfBoundsException();
+	}
+
+	/**
+	 * ����ָ������λ�õ�Ԫ��ֵ
+	 */
+	public Object get(int index) {
+
+		rangCheck(index);
+
+		return elementData[index];
+	}
+
+	/**
+	 * ɾ��ָ������λ�õ�Ԫ�أ������ظ�ֵ
+	 */
+	public Object remove(int index) {
+		rangCheck(index);
+
+		Object obj = elementData[index];
+
+		for (int i = index; i < size; i++)
+			elementData[i] = elementData[i + 1];
+
+		size--;
+
+		return obj;
+	}
+
+	/**
+	 * ��������±��Ƿ�Խ��
+	 * 
+	 * @param index
+	 */
+	private void rangCheck(int index) {
+		if (index >= size)
+			throw new IndexOutOfBoundsException();
+	}
+
+	/**
+	 * �������鳤��
+	 */
+	public int size() {
+		return size;
+	}
+
+	/**
+	 * ������
+	 * 
+	 * @return
+	 */
+	public Iterator iterator() {
+		return new Iter();
+	}
+
+	//�������ڲ���
+	private class Iter implements Iterator {
+		int current;
+
+		@Override
+		public boolean hasNext() {
+			return current != size;
+		}
+
+		@Override
+		public Object next() {
+
+			int i = current;
+			rangCheck(i);
+			current++;
+
+			return elementData[i];
+		}
+
+	}
+
+}
+
+

group14/296933284/DataStructuresTest/src/com/coding/basic/BinaryTreeNode.java

@@ -0,0 +1,77 @@
+package com.coding.basic;
+
+public class BinaryTreeNode implements Comparable {
+
+	private Object data;
+	private BinaryTreeNode leftChild;
+	private BinaryTreeNode rightChild;
+
+	public BinaryTreeNode() {
+		super();
+		this.data = null;
+		this.leftChild = null;
+		this.rightChild = null;
+	}
+
+	public BinaryTreeNode(Object data) {
+		super();
+		this.data = data;
+	}
+
+	public Object getData() {
+		return data;
+	}
+
+	public void setData(Object data) {
+		this.data = data;
+	}
+
+	public BinaryTreeNode getLeftChild() {
+		return leftChild;
+	}
+
+	public void setLeftChild(BinaryTreeNode leftChild) {
+		this.leftChild = leftChild;
+	}
+
+	public BinaryTreeNode getRightChild() {
+		return rightChild;
+	}
+
+	public void setRightChild(BinaryTreeNode rightChild) {
+		this.rightChild = rightChild;
+	}
+
+	/**
+	 * �����в���ڵ�
+	 * 
+	 * @param i
+	 */
+	public void insert(int i) {
+
+	}
+
+	// ...
+	@Override
+	public int compareTo(Object obj) {	
+
+		return 0;
+	}
+
+
+}
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

group14/296933284/DataStructuresTest/src/com/coding/basic/Iterator.java

@@ -0,0 +1,6 @@
+package com.coding.basic;
+
+public interface Iterator {
+	public boolean hasNext();
+	public Object next();
+}