Master

group10/364298692/article.md

@@ -0,0 +1,3 @@
+# ÿ����������
+## week01 ����������
+

group10/364298692/cs/.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/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

group10/364298692/cs/.gitignore

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

group10/364298692/cs/.project

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

group10/364298692/cs/.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

group10/364298692/cs/src/com/coding/basic/ArrayList.java

@@ -0,0 +1,75 @@
+package com.coding.basic;
+
+import java.util.Arrays;
+
+public class ArrayList implements List{
+
+	private int size = 0;
+
+	private Object[] elementData;
+
+	public ArrayList(int initialCapacity){
+		elementData = new Object[initialCapacity];
+	}
+
+	public ArrayList(){
+		elementData = new Object[10];
+	}
+
+	public void ensureCapacity(int minCapacity){
+		int oldCapacity = elementData.length;
+		if(minCapacity > oldCapacity){
+			Object[] oldData = elementData;
+			int newCapacity = (oldCapacity * 3) / 2 + 1;
+			if(minCapacity > newCapacity){
+				newCapacity = minCapacity;
+			}
+			elementData = Arrays.copyOf(elementData, newCapacity);
+		}
+	}
+
+	public void add(Object o){
+		ensureCapacity(size + 1);
+		elementData[size] = o;
+		size++;
+	}
+	public void add(int index, Object o){
+		ensureCapacity(size + 1);
+		for(int i = size-1; i >= index; i--){
+			elementData[i+1] = elementData[i];
+		}
+		elementData[index] = o;	
+		size++;
+	} 
+
+	public Object get(int index){
+		if(index > size-1){
+			return null;
+		}else{
+			return elementData[index];
+		}
+	}
+
+	public Object remove(int index){
+		if(index > size-1){
+			return null;
+		}else{
+			Object obj = elementData[index];
+			for(int i=index; i<size-1; i++){
+				elementData[index] = elementData[index+1];
+			}
+			size--;
+			return obj;
+		}
+	}
+
+	public int size(){
+		return size;
+	}
+
+	public Iterator iterator(){
+
+		return null;
+	}
+
+}

group10/364298692/cs/src/com/coding/basic/BinaryTreeNode.java

@@ -0,0 +1,41 @@
+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){
+		BinaryTreeNode node = new BinaryTreeNode();
+		node.data = o;
+		if(data.hashCode() > o.hashCode()){
+			this.right = node;
+		}else{
+			this.left = node;
+		}
+		return  this;
+	}
+
+
+
+}

group10/364298692/cs/src/com/coding/basic/Iterator.java

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

group10/364298692/cs/src/com/coding/basic/LinkedList.java

@@ -0,0 +1,92 @@
+package com.coding.basic;
+
+public class LinkedList implements List {
+
+	private Node head;
+
+	private int size;
+
+	public void add(Object o){
+		addLast(o);		
+	}
+
+	public void add(int index , Object o){
+		Node node = head;
+		for(int i = 0; i < index; i++){
+			node = node.next;
+		}
+		Node newNode = new Node();
+		newNode.data = o;
+		newNode.next = node.next;
+		node.next = newNode;
+		size++;
+	}
+	public Object get(int index){
+		if(index > size-1){
+			return null;
+		}else{
+			Node node = head;
+			for(int i = 0; i < index; i++){
+				node = node.next;
+			}
+			return node.data;
+		}		
+	}
+	public Object remove(int index){
+		if(index > size-1){
+			return null;
+		}else if(index == 0){
+			Object obj = head.data;
+			head = head.next;
+			size--;
+			return obj;
+		}else{
+			Node node = head;
+			//��ñ�ɾ���ڵ��ǰһ���ڵ�
+			for(int i = 0; i < index-1; i++){
+				node = node.next;
+			}
+			Object obj = node.next.data;
+			node.next = node.next.next;
+			size--;
+			return obj;
+		}		
+	}
+
+	public int size(){
+		return size;
+	}
+
+	public void addFirst(Object o){
+		Node newHead = new Node();
+		newHead.data = o;
+		newHead.next = head;
+		head = newHead;
+		size++;
+	}
+	public void addLast(Object o){
+		Node node = head;
+		while(node.next != null){
+			node = node.next;
+		}
+		Node newNode = new Node();
+		newNode.data = o;
+		node.next = newNode;
+		size++;
+	}
+	public Object removeFirst(){
+		return remove(0);
+	}
+	public Object removeLast(){		
+		return remove(size);
+	}
+	public Iterator iterator(){
+		return null;
+	}
+
+
+	private static class Node{
+		Object data;
+		Node next;		
+	}
+}

group10/364298692/cs/src/com/coding/basic/List.java

@@ -0,0 +1,9 @@
+package com.coding.basic;
+
+public interface List {
+	public void add(Object o);
+	public void add(int index, Object o);
+	public Object get(int index);
+	public Object remove(int index);
+	public int size();
+}

group10/364298692/cs/src/com/coding/basic/Queue.java

@@ -0,0 +1,23 @@
+package com.coding.basic;
+
+public class Queue {
+
+	private LinkedList linkedList;
+
+	public void enQueue(Object o){
+		linkedList.addLast(o);
+	}
+
+	public Object deQueue(){
+		Object obj = linkedList.removeFirst();
+		return obj;
+	}
+
+	public boolean isEmpty(){
+		return linkedList.size() == 0;
+	}
+
+	public int size(){
+		return linkedList.size();
+	}
+}

group10/364298692/cs/src/com/coding/basic/Stack.java

@@ -0,0 +1,25 @@
+package com.coding.basic;
+
+public class Stack {
+	private ArrayList elementData = new ArrayList();
+
+	public void push(Object o){
+		elementData.add(elementData.size(), o);
+	}
+
+	public Object pop(){
+		Object obj = elementData.remove(elementData.size()-1);
+		return obj;
+	}
+
+	public Object peek(){
+		Object obj = elementData.get(0);
+		return obj;
+	}
+	public boolean isEmpty(){
+		return elementData.size()==0;
+	}
+	public int size(){
+		return elementData.size();
+	}
+}