Merge pull request #4 from wangzhengliang/master

one

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;
+	}
+}