第五组第一次作业

.gitignore

@@ -17,6 +17,8 @@ hs_err_pid*
 #ide config
 .metadata
 .recommenders
+.idea/
+
 
 
 #macOS

group05/1026626960/.classpath

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" path="src"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

group05/1026626960/.gitignore

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

group05/1026626960/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>1026626960Coding</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>

group05/1026626960/src/cn/study1/myIterator.java

@@ -0,0 +1,5 @@
+package cn.study1;
+
+public class myIterator {
+	//
+}

group05/1026626960/src/cn/study1/myQueue.java

@@ -0,0 +1,38 @@
+package cn.study1;
+
+public class myQueue<T> {
+	private class Node{
+		T t;
+		Node next;
+	}
+	private Node first;
+	private Node last;
+	private int N;
+	public boolean isEmpty(){
+		return N==0;
+	}
+	public int size(){
+		return N;
+	}
+	public void enqueue(T t){
+		Node oldlast = last;
+		last = new Node();
+		last.t = t;
+		last.next = null;
+		if(isEmpty()){
+			first = last;
+		}else{
+			oldlast.next = last;
+		}
+		N++;
+	}
+	public T dequeue(){
+		T t = first.t;
+		first = first.next;
+		if(isEmpty()){
+			last = null;
+		}
+		N--;
+		return t;
+	}
+}

group05/1026626960/src/cn/study1/myStack.java

@@ -0,0 +1,29 @@
+package cn.study1;
+
+public class myStack<T> {
+	private class Node{
+		T t;
+		Node next;
+	}
+	private Node first;
+	private int N;
+	public boolean isEmpty(){
+		return N==0;
+	}
+	public int size(){
+		return N;
+	}
+	public void push(T t){
+		Node oldfirst = first;
+		first = new Node();
+		first.t = t;
+		first.next = oldfirst;
+		N++;
+	}
+	public T pop(){
+		T t = first.t;
+		first = first.next;
+		N--;
+		return t;
+	}
+}

group05/1094051862/test01/.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.junit.JUNIT_CONTAINER/4"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

group05/1094051862/test01/.gitignore

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

group05/1094051862/test01/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>test01</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>

group05/1094051862/test01/.settings/org.eclipse.jdt.core.prefs

@@ -0,0 +1,12 @@
+eclipse.preferences.version=1
+org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
+org.eclipse.jdt.core.compiler.codegen.methodParameters=do not generate
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.7
+org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
+org.eclipse.jdt.core.compiler.compliance=1.7
+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.7

group05/1094051862/test01/src/com/coding/basic/ArrayList.java

@@ -0,0 +1,79 @@
+package com.coding.basic;
+
+import java.util.Arrays;
+
+public class ArrayList implements List {
+
+	private int size = 0;
+
+	private Object[] elementData = new Object[10];
+
+	private int increaseSize = 3;
+	private void increaseArray() {
+		Object[] newData = Arrays.copyOf(elementData, elementData.length + increaseSize);
+		elementData = newData;
+	}
+	public void add(Object o){
+		if (size == elementData.length) {
+			increaseArray();
+			elementData[size++] = o;
+		} else {
+			elementData[size++] = o;
+		}
+	}
+	public void add(int index, Object o){
+		if (index < 0 || index > size) {
+			System.out.println("错误提示：index > size || index < 0");
+			return;
+		}
+		Object temp;
+		for (int i = index; i < size; i++) {
+			temp = elementData[i];
+			elementData[i] = o;
+			o = temp;
+		}
+		elementData[size ++] = o;
+	}
+
+	public Object get(int index){
+		if (index < 0 || index > size ){
+			return null;
+		}
+		return elementData[index];
+	}
+
+	public Object remove(int index){
+		if (index < 0 || index > size ){
+			return null;
+		}
+		Object result = elementData[index];
+		for (int i = index; i < size-1; i++) {
+			elementData[i] = elementData[i + 1];
+		}
+		elementData[size-1] = null;
+		size --;
+		return result;
+	}
+
+	public int size(){
+		return size;
+	}
+
+	public Iterator iterator(){
+		return new Iterator() {
+			private int cusor = 0;
+			@Override
+			public Object next() {
+				if (!hasNext()) {
+					System.out.println("next: !hasNext");
+					return null;
+				}
+				return elementData[cusor ++];
+			}
+			@Override
+			public boolean hasNext() {
+				return cusor < size;
+			}
+		};
+	}
+}

group05/1094051862/test01/src/com/coding/basic/ArrayListTest.java

@@ -0,0 +1,31 @@
+package com.coding.basic;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+public class ArrayListTest {
+
+	@Test
+	public void test() {
+		List list = new ArrayList();
+		for(int i = 0; i < 10; i++) {
+			list.add(i);
+		}
+		Assert.assertEquals(10, list.size());
+		list.add(11);
+		list.add(3,99);
+		Assert.assertEquals(99, list.get(3));
+		Assert.assertEquals(12, list.size());
+		Assert.assertEquals(99, list.remove(3));
+		Assert.assertEquals(11, list.size());
+		Iterator iterator = list.iterator();
+		for (int i = 0; i< list.size(); i++) {
+			System.out.println(list.get(i));
+		}
+		System.out.println("======");
+		while (iterator.hasNext()) {
+			System.out.println(iterator.next());
+		}
+	}
+
+}

group05/1094051862/test01/src/com/coding/basic/BinaryTreeNode.java

@@ -0,0 +1,32 @@
+package com.coding.basic;
+
+public class BinaryTreeNode {
+
+	private Object data;
+	private BinaryTreeNode left;
+	private BinaryTreeNode 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){
+		return  null;
+	}
+
+}

group05/1094051862/test01/src/com/coding/basic/Iterator.java

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