diff --git a/group24/893022254/task1-list/.gitignore b/group24/893022254/task1-list/.gitignore
new file mode 100644
index 0000000000..166a44c4db
--- /dev/null
+++ b/group24/893022254/task1-list/.gitignore
@@ -0,0 +1,5 @@
+/.settings/
+/bin/
+.classpath
+.project
+
diff --git a/group24/893022254/task1-list/src/com/oneflyingleaf/util/ArrayList.java b/group24/893022254/task1-list/src/com/oneflyingleaf/util/ArrayList.java
new file mode 100644
index 0000000000..b584ffb99b
--- /dev/null
+++ b/group24/893022254/task1-list/src/com/oneflyingleaf/util/ArrayList.java
@@ -0,0 +1,106 @@
+package com.oneflyingleaf.util;
+
+import java.util.Arrays;
+
+public class ArrayList implements List {
+	
+	//非线程安全
+	private int size = 0;
+	
+	private Object[] elementData = new Object[100];
+	
+	public void add(Object o){
+		
+		checkLength(1);
+		
+		elementData[ size ++] = o;
+	}
+	
+	
+	public void add(int index, Object o){
+		checkBound(index);
+		
+		if(index != size){
+			checkLength(1);
+		}
+		
+		int temp = index;
+		
+		//index == size  不移动，直接放 
+		while(index < size){
+			elementData[ ++ index ]  = elementData[index];
+		}
+		
+		size ++ ;
+		elementData[temp] = o;
+	}
+	
+	public Object get(int index){
+		checkBound(index);
+		
+		return elementData [index];
+	}
+	
+    public Object remove(int index){
+    	checkBound(index);
+    	
+    	Object ret = elementData[index];
+    	while(index < size){
+    		elementData[index] = elementData[ ++ index];
+    	}
+    	
+    	-- size ;
+		
+    	return ret;
+	}
+	
+	public int size(){
+		return size;
+	}
+	
+	public Iterator iterator(){
+		return new ArrayListIterator();
+	}
+	
+	/**
+	 * 判断扩容
+	 * @param length
+	 */
+	private void checkLength(int length){
+		if( (size + length) > elementData.length){
+			//默认扩大一倍
+			Arrays.copyOf(elementData, elementData.length << 1);
+		}
+	}
+	
+	/**
+	 * 校验是否超出
+	 * @param index
+	 */
+	private void checkBound(int index){
+		if(index < 0 || index > size){
+			throw new IndexOutOfBoundsException("size : " + size +" , index : " + index);
+		}
+	}
+	
+	
+	private class ArrayListIterator implements Iterator{
+		
+		private int count = -1;
+		
+		private ArrayListIterator(){
+		}
+		
+		@Override
+		public boolean hasNext() {
+			return  (count+1) < size?true:false;
+		}
+
+		@Override
+		public Object next() {
+			count ++ ;
+			return elementData[count];
+		}
+		
+	}
+}
diff --git a/group24/893022254/task1-list/src/com/oneflyingleaf/util/BinaryTreeNode.java b/group24/893022254/task1-list/src/com/oneflyingleaf/util/BinaryTreeNode.java
new file mode 100644
index 0000000000..4b1a92b1fb
--- /dev/null
+++ b/group24/893022254/task1-list/src/com/oneflyingleaf/util/BinaryTreeNode.java
@@ -0,0 +1,57 @@
+package com.oneflyingleaf.util;
+
+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){
+		if(! (o instanceof Comparable)){
+			throw new RuntimeException("未实现Comparable接口");
+		}
+		Comparable<Object> temp = (Comparable<Object>)o;
+		
+		if(temp.compareTo(data) > 0){
+			if(right == null){
+				right= new BinaryTreeNode();
+				right.data = o;
+			}else{
+				right.insert(o);
+			}
+		}
+		
+		if(temp.compareTo(data) <= 0){
+			if(left == null){
+				
+				left = new BinaryTreeNode();
+				left.data = o;
+			}else{
+				left.insert(o);
+			}
+		}
+		
+		
+		return this;
+	}
+	
+}
diff --git a/group24/893022254/task1-list/src/com/oneflyingleaf/util/Iterator.java b/group24/893022254/task1-list/src/com/oneflyingleaf/util/Iterator.java
new file mode 100644
index 0000000000..984a561ab9
--- /dev/null
+++ b/group24/893022254/task1-list/src/com/oneflyingleaf/util/Iterator.java
@@ -0,0 +1,7 @@
+package com.oneflyingleaf.util;
+
+public interface Iterator {
+	public boolean hasNext();
+	public Object next();
+
+}
diff --git a/group24/893022254/task1-list/src/com/oneflyingleaf/util/LinkedList.java b/group24/893022254/task1-list/src/com/oneflyingleaf/util/LinkedList.java
new file mode 100644
index 0000000000..06c5643f53
--- /dev/null
+++ b/group24/893022254/task1-list/src/com/oneflyingleaf/util/LinkedList.java
@@ -0,0 +1,380 @@
+package com.oneflyingleaf.util;
+
+
+
+public class LinkedList implements List {
+	
+	private Node head;
+
+	//虚拟tail节点,方便add最后节点，减少成,tail为链表的最后一个元素
+	private Node tail;
+	
+	private int size ; 
+	
+	public void add(Object o){
+		size ++ ;
+		
+		if(head == null){
+			head = new Node();
+			
+			head.data = o;
+			
+			tail = head;
+			
+			return ;
+		}
+		
+		Node node = tail;
+		tail = new Node();
+
+		node.next = tail;
+		tail.data = o;
+		
+	}
+	public void add(int index , Object o){
+		checkBound(index,true);
+		if(index == 0){
+			addFirst(o);
+			return ;
+		} 
+		
+		if(index == (size - 1)){
+			add(o);
+			return ;
+		}
+		
+		size ++;
+		Node node = head;
+		while(index-- > 0){
+			node = node.next;
+		}
+		
+		Node temp = new Node();
+		temp.data = o;
+		temp.next = node.next;
+		
+		node.next = temp;
+		
+	}
+	public Object get(int index){
+		checkBound(index,false);
+		
+		Node node = head;
+		
+		while(index > 0){
+			index -- ;
+			node = node.next;
+		}
+		
+		return node.data;
+	}
+
+	public Object remove(int index){
+		checkBound(index,false);
+		
+		if(index == 0){
+			removeFirst();
+		}
+		if(index == (size-1)){
+			removeLast();
+		}
+		
+		size --;
+		
+		Node node = head;
+		while(--index > 0){
+			node = node.next;
+		}
+		Object o = node.next.data;
+		node.next = node.next.next; 
+		
+		return o;
+	}
+	
+	public int size(){
+		return size ;
+	}
+	
+	public void addFirst(Object o){
+		size ++ ;
+
+		Node node = new Node();
+		node.data = o;
+		node.next = head;
+		head = node;
+	}
+	public void addLast(Object o){
+		add(o);
+	}
+	
+	
+	public Object removeFirst(){
+		checkBound(0,true);
+
+		if(size == 0){
+			//处理tail节点，防止占用引用资源回收不了
+			tail.data = null;
+		}
+		size -- ;
+
+		Object o = head.data;
+	
+		head = head.next;
+		
+		return o;
+	}
+
+	public Object removeLast(){
+		if(size == 0){
+			//直接移除首节点，则无需处理尾节点
+			removeFirst();
+		}
+		size -- ;
+		
+		Object o = tail.data;
+		
+		tail = null;
+		
+		Node temp = head ;
+		while(temp != null){
+			temp = temp.next;
+		}
+		
+		tail = temp;
+		return o;
+		
+	}
+	public Iterator iterator(){
+		return new LinkedListIterator();
+	}
+	
+	
+	private static  class Node{
+		Object data;
+		Node next;
+		
+	}
+	
+	/**
+	 * 把该链表逆置
+	 * 例如链表为 3->7->10 , 逆置后变为  10->7->3
+	 */
+	public  void reverse(){	
+		Node node = head.next;
+		Node pre = head;
+
+		Node next;
+		while(node.next != null){
+			next = node.next;
+			
+			node.next = pre;
+			
+			pre = node;
+			node = next;
+		}
+		//处理尾元素
+		node.next = pre;
+		
+		next = tail;
+		tail = head;
+		head = next;
+		
+		tail.next = null;
+	}
+	
+	/**
+	 * 删除一个单链表的前半部分
+	 * 例如：list = 2->5->7->8 , 删除以后的值为 7->8
+	 * 如果list = 2->5->7->8->10 ,删除以后的值为7,8,10
+
+	 */
+	public  void removeFirstHalf(){
+		int size = this.size / 2;
+		
+		for(int i = 0;i < size ; i++){
+			removeFirst();
+		}
+	}
+	
+	/**
+	 * 从第i个元素开始， 删除length 个元素 ， 注意i从0开始
+	 * @param i
+	 * @param length
+	 */
+	public  void remove(int i, int length){
+		for(int j = i;length > 0; length -- ,j++ ){
+			remove(j);
+		}
+	}
+	/**
+	 * 假定当前链表和list均包含已升序排列的整数
+	 * 从当前链表中取出那些list所指定的元素
+	 * 例如当前链表 = 11->101->201->301->401->501->601->701
+	 * listB = 1->3->4->6
+	 * 返回的结果应该是[101,301,401,601]  
+	 * @param list
+	 */
+	public Object[] getElements(LinkedList list){
+		Object []  ret = new Object[list.size];
+		
+		for(int i = 0 ;i < list.size;i++){
+			ret[i] = get((int) list.get(i));
+		}
+		return ret;
+	}
+	
+	/**
+	 * 已知链表中的元素以值递增有序排列，并以单链表作存储结构。
+	 * 从当前链表中中删除在list中出现的元素 
+	 * @param list
+	 */
+	
+	public  void subtract(LinkedList list){
+		int size = this.size > list.size()?this.size : list.size();
+		
+		int temp = 0;
+		for(int i = 0;i < size ;i++){
+			if(temp == size || i == list.size){
+				return ;
+			}
+			
+			
+			if((int)list.get(i) > (int)get(temp)){
+				temp ++;
+			}else if((int)list.get(i) < (int)get(temp)){
+				continue;
+			}else{
+				remove(temp);
+			}
+			
+		}
+		
+		
+
+	}
+	
+	/**
+	 * 已知当前链表中的元素以值递增有序排列，并以单链表作存储结构。
+	 * 删除表中所有值相同的多余元素（使得操作后的线性表中所有元素的值均不相同）
+	 */
+	public  void removeDuplicateValues(){
+		if(size == 0){
+			return ;
+		}
+		
+		Object o = get(0);
+		
+		for(int i = 0;i < (size - 1) ;i++){
+			if(o.equals(get(i + 1))){
+				remove(i + 1);
+				i--;
+			}
+			o = get(i);
+		}
+	}
+	
+	/**
+	 * 已知链表中的元素以值递增有序排列，并以单链表作存储结构。
+	 * 试写一高效的算法，删除表中所有值大于min且小于max的元素（若表中存在这样的元素）
+	 * @param min
+	 * @param max
+	 */
+	public  void removeRange(int min, int max){
+		if(size == 0 || max < (int)get(0) || min > (int)get(size - 1)){
+			return ;
+		}
+		int minIndex = getIndex(min,0,size);
+		int maxIndex = getIndex(max,0,size);
+
+		remove(minIndex,maxIndex - minIndex );		
+	}
+	
+	/**
+	 * 假设当前链表和参数list指定的链表均以元素依值递增有序排列（同一表中的元素值各不相同）
+	 * 现要求生成新链表C，其元素为当前链表和list中元素的交集，且表C中的元素有依值递增有序排列
+	 * @param list
+	 */
+	public  LinkedList intersection( LinkedList list){
+		LinkedList ret = new LinkedList();
+		
+		int temp = 0;
+		for(int i = 0;i < size ;i++){
+			if(temp == size || i == list.size){
+				return ret ;
+			}
+			
+			
+			if((int)list.get(i) > (int)get(temp)){
+				temp ++;
+			}else if((int)list.get(i) < (int)get(temp)){
+				continue;
+			}else{
+				ret.add(list.get(i));
+			}
+			
+		}
+		return ret ;
+	}
+	
+	
+	private class LinkedListIterator implements Iterator{
+		Node node = null;
+		@Override
+		public boolean hasNext() {
+			if(node == null){
+				return head != null;
+			}
+			return node.next != null;
+		}
+
+		@Override
+		public Object next() {
+			if(node == null){
+				node = head;
+			}else{
+				node = node.next;
+			}
+			return node.data;
+		}
+		
+	}
+	
+	/**
+	 * 数组越界提示
+	 * @param index 数组下标 
+	 * @param contailLast
+	 */
+	private void checkBound(int index , boolean containLast){
+		if(containLast && index == (size + 1) ){
+			return ;
+		}
+		
+		if(index < 0 || index >= size){
+			throw new IndexOutOfBoundsException("idnex:" + index +", size:" + size);
+		}
+	}
+	
+	/**
+	 * 获取不大于val的下标
+	 * @return 
+	 */
+	private int getIndex(int val,int min ,int max){
+		int mid = (0 + size)/2 ;
+		if(max <= min){
+			return min;
+		}
+		if(val > (int)get(mid)){
+			mid = (mid + 1 + max) /2 ;
+			return getIndex(val,mid,max);
+		}else if(val < (int)get(mid)){
+			mid = (mid + min -1) /2;
+			return getIndex(val,min,mid);
+		}else{
+			return mid;
+		}
+		
+		
+				
+				
+	}
+}
diff --git a/group24/893022254/task1-list/src/com/oneflyingleaf/util/List.java b/group24/893022254/task1-list/src/com/oneflyingleaf/util/List.java
new file mode 100644
index 0000000000..a9fc12cfd4
--- /dev/null
+++ b/group24/893022254/task1-list/src/com/oneflyingleaf/util/List.java
@@ -0,0 +1,9 @@
+package com.oneflyingleaf.util;
+
+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();
+}
diff --git a/group24/893022254/task1-list/src/com/oneflyingleaf/util/Queue.java b/group24/893022254/task1-list/src/com/oneflyingleaf/util/Queue.java
new file mode 100644
index 0000000000..0f26cfadcf
--- /dev/null
+++ b/group24/893022254/task1-list/src/com/oneflyingleaf/util/Queue.java
@@ -0,0 +1,26 @@
+package com.oneflyingleaf.util;
+
+public class Queue {
+	
+	private LinkedList list;
+	
+	
+	public void enQueue(Object o){		
+		if(list == null){
+			list = new LinkedList();
+		}
+		list.add(o);
+	}
+	
+	public Object deQueue(){
+		return list.removeFirst();
+	}
+	
+	public boolean isEmpty(){
+		return list == null || list.size() == 0;
+	}
+	
+	public int size(){
+		return list.size();
+	}
+}
diff --git a/group24/893022254/task1-list/src/com/oneflyingleaf/util/Stack.java b/group24/893022254/task1-list/src/com/oneflyingleaf/util/Stack.java
new file mode 100644
index 0000000000..b90e8c44f9
--- /dev/null
+++ b/group24/893022254/task1-list/src/com/oneflyingleaf/util/Stack.java
@@ -0,0 +1,23 @@
+package com.oneflyingleaf.util;
+
+public class Stack {
+	private ArrayList elementData = new ArrayList();
+	
+	public void push(Object o){		
+		elementData.add(o);
+	}
+	
+	public Object pop(){
+		return elementData.remove(elementData.size() - 1);
+	}
+	
+	public Object peek(){
+		return elementData.get(elementData.size() - 1);
+	}
+	public boolean isEmpty(){
+		return elementData.size() > 0;
+	}
+	public int size(){
+		return elementData.size();
+	}
+}
diff --git a/group24/893022254/task1-list/src/com/oneflyingleaf/util/TestClass.java b/group24/893022254/task1-list/src/com/oneflyingleaf/util/TestClass.java
new file mode 100644
index 0000000000..d9056f25ba
--- /dev/null
+++ b/group24/893022254/task1-list/src/com/oneflyingleaf/util/TestClass.java
@@ -0,0 +1,115 @@
+package com.oneflyingleaf.util;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+public class TestClass {
+
+	@Test
+	public void testArrayList(){
+		ArrayList list = new ArrayList();
+		
+		list.add("1A");
+		list.add("2B");
+		list.add("3B");
+		
+		list.add(3, "4D");
+		
+		list.remove(3);
+		Assert.assertEquals(3, list.size());
+		list.remove(0);
+		Assert.assertEquals(2, list.size());
+		Iterator iterator = list.iterator();
+		
+		String []str = {"2B","3B"};
+		int i = 0;
+		
+		while(iterator.hasNext()){
+			Assert.assertEquals(str[i++], (String)iterator.next());
+		}
+		
+	}
+	
+	@Test
+	public void testLinkedList(){
+		LinkedList list = new LinkedList();
+		String []str = {"1A","2B","3C","4D","5E","6F"};
+		
+		for(String s : str){
+			list.add(s);
+		}
+		
+		for(int i = 0; i<list.size();i++){
+			Assert.assertEquals(str[i], list.get(i));
+		}
+		
+		Iterator iterator = list.iterator();
+		int i = 0;
+		
+		while(iterator.hasNext()){
+			Assert.assertEquals(str[i++], (String)iterator.next());
+		}
+		
+		
+		list.addFirst("0Q");
+		Assert.assertEquals("0Q", list.get(0));
+		list.removeFirst();
+		Assert.assertEquals("1A",list.get(0));
+		
+		
+		Assert.assertEquals(str.length, list.size());
+		
+		
+		Assert.assertEquals(str[3],list.remove(3));
+		
+		Assert.assertEquals(str[4], list.get(3));
+		
+		list.reverse();
+		list.reverse();
+		
+		for(int j = 0; j<list.size();j++){
+			System.out.println(list.get(j));
+		}
+		
+		
+		
+	}
+	
+	@Test
+	public void testQueue(){
+		Queue queue = new Queue();
+		
+		String []str = {"1A","2B","3C","4D","5E","6F"};
+		
+		for(String s : str){
+			queue.enQueue(s);
+		}
+		
+		int size = queue.size();
+		for(int i = 0;i < size;i++){
+			Assert.assertEquals(str[i],queue.deQueue());
+		}
+		
+		Assert.assertEquals(0, queue.size());
+	}
+	
+	@Test
+	public void testStack(){
+		Stack stack = new Stack();
+		String []str = {"1A","2B","3C","4D","5E","6F"};
+
+		for(String s : str){
+			stack.push(s);
+		}
+		
+		int size = stack.size();
+		
+		for(int i = 0;i < size;i++){
+			Assert.assertEquals(str[size - 1 - i],stack.pop());
+		}
+		
+	}
+	
+	
+	
+}