From 81b67988584d6bb5e199077d0c54a3bc0d949563 Mon Sep 17 00:00:00 2001
From: szlele <595128841@qq.com>
Date: Sun, 26 Feb 2017 23:12:25 +0800
Subject: [PATCH] =?UTF-8?q?=E7=AC=AC=E4=B8=80=E6=AC=A1=E4=BD=9C=E4=B8=9A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 group10/595128841/Readme.txt                 |   1 +
 group10/595128841/src/org/le/ArrayList.java  | 144 +++++++++
 group10/595128841/src/org/le/LinkedList.java | 299 +++++++++++++++++++
 group10/595128841/src/org/le/List.java       |  19 ++
 4 files changed, 463 insertions(+)
 create mode 100644 group10/595128841/Readme.txt
 create mode 100644 group10/595128841/src/org/le/ArrayList.java
 create mode 100644 group10/595128841/src/org/le/LinkedList.java
 create mode 100644 group10/595128841/src/org/le/List.java

diff --git a/group10/595128841/Readme.txt b/group10/595128841/Readme.txt
new file mode 100644
index 0000000000..a5206d5b31
--- /dev/null
+++ b/group10/595128841/Readme.txt
@@ -0,0 +1 @@
+第一次文章地址：http://www.jianshu.com/p/089ac95363d4		如何自己实现一个简单的ArrayList
\ No newline at end of file
diff --git a/group10/595128841/src/org/le/ArrayList.java b/group10/595128841/src/org/le/ArrayList.java
new file mode 100644
index 0000000000..571362606b
--- /dev/null
+++ b/group10/595128841/src/org/le/ArrayList.java
@@ -0,0 +1,144 @@
+/**
+ * 
+ */
+package org.le;
+
+/**
+ * @author yue
+ * @time 2017年2月19日
+ */
+public class ArrayList<E> implements List<E> {
+	
+	private Object[] elementData;
+	
+	private int size;
+	
+	public ArrayList(int initCapcity){
+		if(initCapcity < 0){
+			throw new IllegalArgumentException("initCapcity 必须大于0");
+		}
+		elementData = new Object[initCapcity];
+	}
+	
+	public ArrayList(){
+		elementData = new Object[10];
+	}
+
+	@Override
+	public void add(Object obj) {
+		grow(size + 1);
+		elementData[size++] = obj;
+	}
+	
+	@Override
+	public void add(int index, Object obj) {
+		rangeCheckForAdd(index);
+		grow(size + 1);
+		System.arraycopy(elementData, index, elementData, index+1, size - index);
+		elementData[index] = obj;
+		size ++;
+	}
+	
+	@Override
+	public void remove(Object obj) {
+		if(obj == null){
+			for (int i = 0; i < size; i++) {
+				if(elementData[i] == null){
+					fastRemove(i);
+				}
+			}
+		}else{
+			for (int i = 0; i < size; i++) {
+				if(obj.equals(elementData[i])){
+					fastRemove(i);
+				}
+			}
+		}
+	}
+
+	@Override
+	public E remove(int index) {
+		rangeCheck(index);
+		int movedNum = size - index - 1;
+		E oldElement = elementData(index);
+		System.arraycopy(elementData, index+1, elementData, index, movedNum);
+		elementData[--size] = null;
+		return oldElement;
+	}
+	
+	@Override
+	public E get(int index) {
+		rangeCheck(index);
+		return elementData(index);
+	}
+
+	@Override
+	public E set(int index, E obj) {
+		rangeCheck(index);
+		E oldElement = elementData(index);
+		elementData[index] = obj;
+		return oldElement;
+	}
+
+	@Override
+	public int indexOf(E obj) {
+		if(obj == null){
+			for (int i = 0; i < size; i++) {
+				if(elementData[i] == null){
+					return i;
+				}
+			}
+		}else{
+			for (int i = 0; i < size; i++) {
+				if(obj.equals(elementData[i])){
+					return i;
+				}
+			}
+		}
+		return -1;
+	}
+	
+	/**
+	 * 数组扩容
+	 * @param minCapacity
+	 */
+	private void grow(int minCapacity) {
+		if(minCapacity <= elementData.length){
+			return;
+		}
+		int oldCapacity = elementData.length;
+		int newCapacity = minCapacity + (oldCapacity >> 1);
+		if(newCapacity < minCapacity){
+			newCapacity = minCapacity;
+		}
+		if(minCapacity > Integer.MAX_VALUE){
+			newCapacity = Integer.MAX_VALUE;
+		}
+		Object[] newArray = new Object[newCapacity];
+		System.arraycopy(elementData, 0, newArray, 0, newCapacity);
+		elementData = newArray;
+	}
+	
+	@SuppressWarnings("unchecked")
+	 private E elementData(int index){
+		return (E) elementData[index];
+	}
+	
+	private void fastRemove(int i) {
+		int numMoved = size - i -1;
+		if(numMoved > 0){
+			System.arraycopy(elementData, i+1, elementData, i, numMoved);
+		}
+		elementData[-- size] = null;
+	}
+	
+	private void rangeCheck(int index){
+		if(index >= size || index <0)
+			throw new IndexOutOfBoundsException("index:"+index+",size:"+size);
+	}
+	
+	private void rangeCheckForAdd(int index){
+		if(index > size || index <0)
+			throw new IndexOutOfBoundsException("index:"+index+",size:"+size);
+	}
+}
diff --git a/group10/595128841/src/org/le/LinkedList.java b/group10/595128841/src/org/le/LinkedList.java
new file mode 100644
index 0000000000..fbe95017cb
--- /dev/null
+++ b/group10/595128841/src/org/le/LinkedList.java
@@ -0,0 +1,299 @@
+/**
+ * 
+ */
+package org.le;
+
+import java.util.NoSuchElementException;
+
+/**
+ * @author yue
+ * @time 2017年2月19日
+ */
+public class  LinkedList<E> implements List<E> {
+	
+	private int size = 0;
+	
+	private Node<E> first;
+	
+	private Node<E> last;
+	
+	private static class Node<E>{
+		E item;
+		Node<E> prev;
+		Node<E> next;
+		Node(Node<E> prev,E item,  Node<E> next) {
+			super();
+			this.item = item;
+			this.prev = prev;
+			this.next = next;
+		}
+	}
+	
+	public LinkedList(){
+		
+	}
+	
+	/**
+	 * 头部插入
+	 */
+	private void linkFirst(E e){
+		final Node<E> f =  first;
+		final Node<E> newNode = new Node<E>(null,e,f);
+		first = newNode;
+		if(f == null)
+			last = newNode;
+		else
+			f.prev = newNode;
+		size ++;
+	}
+	
+	/**
+	 * 尾部插入
+	 */
+	private void linkLast(E e){
+		final Node<E> l = last;
+		final Node<E> newNode = new Node<>(l,e,null);
+		last = newNode;
+		if(last == null)
+			first = newNode;
+		else
+			l.next = newNode;
+		size ++;
+	}
+	
+	/**
+	 * 某个不为null元素之前插入
+	 */
+	private void linkBefore(E e,Node<E> succ){
+		final Node<E> pred = succ.prev;
+		final Node<E> newNode = new Node<>(pred,e,succ);
+		succ.prev = newNode;
+		if(pred == null)
+			first = newNode;
+		else
+			pred.next = newNode;
+		size ++;
+	}
+	
+	/**
+	 * 删除头部元素
+	 */
+	private E unlinkFirst(Node<E> f){
+		final E element = f.item;
+		final Node<E> next = f.next;
+		f.item = null;
+		f.next = null;
+		first = next;
+		if(next == null)
+			last = null;
+		else
+			next.prev = null;
+		size -- ;
+		return element;
+	}
+	/**
+	 * 删除尾部元素
+	 * @param l
+	 * @return
+	 */
+	private E unlinkLast(Node<E> l){
+		final E element = l.item;
+		final Node<E> prev = l.prev;
+		l.item = null;
+		l.prev = null;
+		last = prev;
+		if(prev == null)
+			first = null;
+		else
+			prev.next = null;
+		size -- ;
+		return element;
+	}
+	
+	/**
+	 * 删除指定节点
+	 * @param e
+	 * @return
+	 */
+	private E unlink(Node<E> e){
+		final Node<E> prev = e.prev;
+		final E element = e.item;
+		final Node<E> next = e.next;
+		
+		if(prev == null){
+			first = next;
+		}else{
+			prev.next = next;
+			e.prev = null;
+		}
+			
+		if(next == null){
+			last = prev;
+		}else{
+			next.prev = prev;
+			e.next = null;
+		}
+		e.item = null;
+		size -- ;
+		return element;
+	}
+	
+	/**
+	 * 该方法默认在尾部添加
+	 */
+	@Override
+	public void add(E e) {
+		linkLast(e);
+	}
+
+	/**
+	 *
+	 */
+	@Override
+	public void add(int index, E e) {
+		checkPositionIndex(index);
+		if(index == size){
+			linkLast(e);
+		}else{
+			linkBefore(e, node(index));
+		}
+	}
+	
+	private Node<E> node(int index) {
+		//小于容量一半
+		if(index < (size >> 1)){
+			Node<E> x = first;
+			for(int i = 0; i < index; i++){
+				x = x.next;
+			}
+			return x;
+		}else{
+			Node<E> x = last;
+			for(int i = size - 1; i > index; i --){
+				x = x.prev; 
+			}
+			return x;
+		}
+	}
+
+	private void checkPositionIndex(int index){
+		if(index <0 || index > size){
+			throw new IndexOutOfBoundsException("索引越界：index："+index+"，size："+size);
+		}
+	}
+	
+	private void checkElementIndex(int index){
+		if(index <0 || index >= size){
+			throw new IndexOutOfBoundsException("索引越界：index："+index+"，size："+size);
+		}
+	}
+
+	/**
+	 *
+	 */
+	@Override
+	public void remove(E obj) {
+		if(obj == null){
+			for(Node<E> x = first;x != null; x = x.next){
+				if(x.item == null){
+					unlink(x);
+				}
+			}
+		}else{
+			for(Node<E> x = first;x != null;x = x.next){
+				if(obj.equals(x.item)){
+					unlink(x);
+				}
+			}
+		}
+	}
+
+	/**
+	 *
+	 */
+	@Override
+	public E remove(int index) {
+		checkElementIndex(index);
+		return unlink(node(index));
+	}
+
+	/**
+	 *
+	 */
+	@Override
+	public E get(int index) {
+		checkElementIndex(index);
+		return node(index).item;
+	}
+
+	/**
+	 *
+	 */
+	@Override
+	public E set(int index, E obj) {
+		checkElementIndex(index);
+		Node<E> x = node(index);
+		E oldVal = x.item;
+		x.item = obj;
+		return oldVal;
+	}
+
+	/**
+	 *
+	 */
+	@Override
+	public int indexOf(E obj) {
+		int index = 0;
+		if(obj == null){
+			for(Node<E> x = first;x != null;x = x.next){
+				if(x.item == null)
+					return index;
+				index ++;
+			}
+		}else{
+			for(Node<E> x = first; x != null; x = x.next){
+				if(obj.equals(x.item))
+					return index;
+				index ++;
+			}
+		}
+		return -1;
+	}
+	/**
+	 * 弹出栈顶的元素，不删除元素
+	 * @param e
+	 * @return
+	 */
+	public E peek(){
+		final Node<E> e = first;
+		return e == null ? null : e.item;
+	}
+	
+	/**
+	 * 弹出栈顶元素，删除元素
+	 * @return
+	 */
+	public E poll(){
+		final Node<E> e = first;
+		return (e == null) ? null : unlinkFirst(e);
+	}
+	/**
+	 * 入栈，栈顶
+	 * @param e
+	 */
+	public void push(E e){
+		linkFirst(e);
+	}
+	
+	/**
+	 * 出栈，删除并返回栈顶元素
+	 * @return
+	 */
+	public E pop(){
+		final Node<E> f = first;
+		if(f == null)
+			throw new NoSuchElementException();
+		return unlinkFirst(f);
+	}
+
+}
diff --git a/group10/595128841/src/org/le/List.java b/group10/595128841/src/org/le/List.java
new file mode 100644
index 0000000000..5fa9d6799a
--- /dev/null
+++ b/group10/595128841/src/org/le/List.java
@@ -0,0 +1,19 @@
+package org.le;
+
+public interface List<E> {
+	
+	void add(E obj);
+	
+	void add(int index,E obj);
+	
+	void remove(E obj);
+	
+	E remove(int index);
+	
+	E get(int index);
+	
+	E set(int index,E obj);
+	
+	int indexOf(E obj);
+
+}