Submit first week & second week homework

group24/1525619747/.gitignore

@@ -0,0 +1,5 @@
+*bin/
+
+.project
+.classpath
+.settings

group24/1525619747/homework_20170312/src/com/basic/ArrayList.java

@@ -0,0 +1,95 @@
+package com.basic;
+
+public class ArrayList implements List
+{
+
+	private int size = 0;
+
+	private final int MAXNSIZE = 100;
+
+	private Object[] elementData = new Object[MAXNSIZE];
+
+	public void add(Object o)
+	{
+		if (size > MAXNSIZE)
+		{
+			String errorInfo = "Out of max size" + MAXNSIZE;
+			throw new ArrayIndexOutOfBoundsException(errorInfo);
+		}
+		elementData[size++] = o;
+	}
+
+	public void add(int index, Object o)
+	{
+		if (index >= size && size > 0)
+		{
+			String errorInfo = "Index to add: " + index
+					+ " is out of current size: " + size;
+			throw new ArrayIndexOutOfBoundsException(errorInfo);
+		}
+		for (int i = size; i > index; i--)
+		{
+			elementData[i] = elementData[i - 1];
+		}
+		elementData[index] = o;
+		++size;
+	}
+
+	public Object get(int index)
+	{
+		if (index < 0 || index >= size)
+		{
+			String errorInfo = "Index to get: " + index
+					+ " is invalid, current range: 0 - " + (size - 1);
+			throw new ArrayIndexOutOfBoundsException(errorInfo);
+		}
+		return elementData[index];
+	}
+
+	public Object remove(int index)
+	{
+		if (index < 0 || index >= size)
+		{
+			String errorInfo = "Index to remove: " + index
+					+ " is invalid, current range: 0 - " + (size - 1);
+			throw new ArrayIndexOutOfBoundsException(errorInfo);
+		}
+
+		Object o = elementData[index];
+		for (int i = index; i < size - 1; i++)
+		{
+			elementData[i] = elementData[i + 1];
+		}
+		elementData[size--] = null;
+		return o;
+	}
+
+	public int size()
+	{
+		return size;
+	}
+
+	public Iterator iterator()
+	{
+		return new Iterator()
+		{
+
+			private int index = 0;
+
+			public boolean hasNext()
+			{
+				return (index < size);
+			}
+
+			public Object next()
+			{
+				if (hasNext())
+				{
+					return elementData[index++];
+				}
+				return null;
+			}
+		};
+	}
+
+}

group24/1525619747/homework_20170312/src/com/basic/BinaryTreeNode.java

@@ -0,0 +1,103 @@
+package com.basic;
+
+public class BinaryTreeNode
+{
+
+	private Object data;
+	private BinaryTreeNode left;
+	private BinaryTreeNode right;
+
+	public BinaryTreeNode (Object data)
+	{
+		this.data = data;
+		left = null;
+		right = null;
+	}
+
+	public BinaryTreeNode (Object data, BinaryTreeNode left,
+			BinaryTreeNode right)
+	{
+		this.data = data;
+		this.left = left;
+		this.right = right;
+	}
+
+	public Object getData()
+	{
+		return data;
+	}
+
+	public void setData(Object 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(Object o)
+	{
+		if (((Integer) data) > ((Integer) o))
+		{
+			if (left == null)
+			{
+				setLeft(new BinaryTreeNode(o));
+			}
+			else
+			{
+				left.insert(o);
+			}
+		}
+		else
+		{
+			if (right == null)
+			{
+				setRight(new BinaryTreeNode(o));
+			}
+			else
+			{
+				right.insert(o);
+			}
+		}
+		return this;
+	}
+
+	/*
+	 * 前序遍历
+	 */
+	public void preOrderInterator()
+	{
+		if (left != null)
+		{
+			left.preOrderInterator();
+		}
+
+		System.out.print(data.toString() + " ");
+
+		if (right != null)
+		{
+			right.preOrderInterator();
+		}
+	}
+
+}

group24/1525619747/homework_20170312/src/com/basic/Iterator.java

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