diff --git a/group24/121111914/.gitignore b/group24/121111914/.gitignore
new file mode 100644
index 0000000000..ae3c172604
--- /dev/null
+++ b/group24/121111914/.gitignore
@@ -0,0 +1 @@
+/bin/
diff --git a/group24/121111914/src/com/github/ipk2015/coding2017/basic/test/TestForDell.java b/group24/121111914/src/com/github/ipk2015/coding2017/basic/test/TestForDell.java
new file mode 100644
index 0000000000..01d2c8d5fc
--- /dev/null
+++ b/group24/121111914/src/com/github/ipk2015/coding2017/basic/test/TestForDell.java
@@ -0,0 +1,10 @@
+package com.github.ipk2015.coding2017.basic.test;
+
+public class TestForDell {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}
diff --git a/group24/121111914/src/com/github/ipk2015/coding2017/coderising/array/ArrayUtil.java b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/array/ArrayUtil.java
new file mode 100644
index 0000000000..d1ddfb6339
--- /dev/null
+++ b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/array/ArrayUtil.java
@@ -0,0 +1,229 @@
+package com.github.ipk2015.coding2017.coderising.array;
+
+
+
+import java.util.ArrayList;
+import java.util.Arrays;
+
+public class ArrayUtil {
+    /**
+     * 给定一个整形数组a , 对该数组的值进行置换
+     例如： a = [7, 9 , 30, 3]  ,   置换后为 [3, 30, 9,7]
+     如果     a = [7, 9, 30, 3, 4] , 置换后为 [4,3, 30 , 9,7]
+     * @param origin
+     * @return
+     */
+    public void reverseArray(int[] origin){
+        int temp=0;
+        for(int i=0;i<origin.length/2;i++){
+            temp=origin[i];
+            origin[i]=origin[origin.length-i-1];
+            origin[origin.length-i-1]=temp;
+        }
+    }
+
+    /**
+     * 现在有如下的一个数组：   int oldArr[]={1,3,4,5,0,0,6,6,0,5,4,7,6,7,0,5}
+     * 要求将以上数组中值为0的项去掉，将不为0的值存入一个新的数组，生成的新数组为：
+     * {1,3,4,5,6,6,5,4,7,6,7,5}
+     * @param oldArray
+     * @return
+     */
+
+    public int[] removeZero(int[] oldArray){
+        int[] newArray=new int[oldArray.length];
+        int size=0;
+        for(int i=0;i<oldArray.length;i++){
+            if(oldArray[i]!=0){
+                newArray[size]=oldArray[i];
+                size++;
+            }
+        }
+        newArray= Arrays.copyOf(newArray,size);
+        return newArray;
+    }
+
+    /**
+     * 给定两个已经排序好的整形数组， a1和a2 ,  创建一个新的数组a3, 使得a3 包含a1和a2 的所有元素， 并且仍然是有序的
+     * 例如 a1 = [3, 5, 7,8]   a2 = [4, 5, 6,7]    则 a3 为[3,4,5,6,7,8]    , 注意： 已经消除了重复
+     * @param array1
+     * @param array2
+     * @return
+     */
+    //两种思路：一种是先排序，后删除重复元素；一种是直接按顺序插好；
+    public int[] merge(int[] array1, int[] array2){
+        checkArraySort(array1);
+        checkArraySort(array2);
+        ArrayList<Integer> list= new ArrayList();
+        for(int i=0;i<array1.length;i++){
+            list.add(array1[i]);
+        }
+        int size;
+        for(int i=0;i<array2.length;i++){
+        	size=list.size();
+            for(int j=0;j<size;j++){
+                if(array2[i]<list.get(j)){
+                    list.add(j,array2[i]);
+                    break;
+                }
+                if(array2[i]==list.get(j)){
+                    break;
+                }
+                if(j==size-1){
+                	list.add(array2[i]);
+                }
+            }
+        }
+        int[] tempArray=new int[list.size()];
+        for(int i=0;i<tempArray.length;i++){
+            tempArray[i]=list.get(i);
+        }
+        return  tempArray;
+    }
+    /*
+    * 检查数组是否按从小到大排序，且无重复元素
+    * */
+    private void checkArraySort(int[] array){
+        if(array.length<2){
+            return;
+        }
+        for(int i=0;i<array.length-1;i++){
+            if(array[i]>=array[i+1]){
+                throw new RuntimeException("不是排序好的数组");
+            }
+        }
+    }
+    /**
+     * 把一个已经存满数据的数组 oldArray的容量进行扩展， 扩展后的新数据大小为oldArray.length + size
+     * 注意，老数组的元素在新数组中需要保持
+     * 例如 oldArray = [2,3,6] , size = 3,则返回的新数组为
+     * [2,3,6,0,0,0]
+     * @param oldArray
+     * @param size
+     * @return
+     */
+    public int[] grow(int [] oldArray,  int size){
+        int[] newArray=new int[oldArray.length+size];
+        for(int i=0;i<oldArray.length;i++){
+            newArray[i]=oldArray[i];
+        }
+        return newArray;
+    }
+
+    /**
+     * 斐波那契数列为：1，1，2，3，5，8，13，21......  ，给定一个最大值， 返回小于该值的数列
+     * 例如， max = 15 , 则返回的数组应该为 [1，1，2，3，5，8，13]
+     * max = 1, 则返回空数组 []
+     * @param max
+     * @return
+     */
+    public int[] fibonacci(int max){
+        if(max<=1){
+            return new int[0];
+        }
+        ArrayList<Integer> list=new ArrayList();
+        list.add(1);
+        list.add(1);
+        int size=2;
+        int lastElement=2;
+        while(lastElement<max){
+            list.add(lastElement);
+            size++;
+            lastElement=list.get(size-1)+list.get(size-2);
+        }
+        int[] array=new int[size];
+        for(int i=0;i<array.length;i++){
+            array[i]=list.get(i);
+        }
+        return array;
+    }
+
+    /**
+     * 返回小于给定最大值max的所有素数数组
+     * 例如max = 23, 返回的数组为[2,3,5,7,11,13,17,19]
+     * @param max
+     * @return
+     */
+    public int[] getPrimes(int max){
+        if(max<3){
+            return new int[0];
+        }
+        ArrayList<Integer> list=new ArrayList();
+        list.add(2);
+        for(int i=3;i<max;i++){
+            if(isPrimes(i)){
+                list.add(i);
+            }
+        }
+        int[] array=new int[list.size()];
+        for(int i=0;i<array.length;i++){
+            array[i]=list.get(i);
+        }
+        return array;
+    }
+    private boolean isPrimes(int number){
+        if(number<2){
+            return false;
+        }
+        for(int i=2;i<number;i++){
+            if(number%i ==0){
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * 所谓“完数”， 是指这个数恰好等于它的因子之和，例如6=1+2+3，
+     * 10000以内的完全数：6，28，496，8128，下一个是33550336....
+     * 给定一个最大值max， 返回一个数组， 数组中是小于max 的所有完数
+     * @param max
+     * @return
+     */
+    public int[] getPerfectNumbers(int max){
+        if(max<2){
+            return new int[0];
+        }
+        ArrayList<Integer> list=new ArrayList();
+        for(int i=2;i<max;i++){
+            if(isPerfectNumbers(i)){
+                list.add(i);
+            }
+        }
+        int[] array=new int[list.size()];
+        for(int i=0;i<array.length;i++){
+            array[i]=list.get(i);
+        }
+        return array;
+    }
+
+    private boolean isPerfectNumbers(int number){
+        int sum=1;
+        for(int i=2;i<number;i++){
+            if(number%i==0){
+                sum=sum+i;
+            }
+        }
+        return sum==number;
+    }
+    /**
+     * 用seperator 把数组 array给连接起来
+     * 例如array= [3,8,9], seperator = "-"
+     * 则返回值为"3-8-9"
+     * @param array
+     * @param separator
+     * @return
+     */
+    public String join(int[] array, String separator){
+        int size=array.length;
+        if(size==0){
+            return "";
+        }
+        StringBuilder stringBuilder=new StringBuilder();
+        stringBuilder.append(array[0]+"");
+        for(int i=1;i<size;i++){
+            stringBuilder.append(separator+array[i]);
+        }
+        return stringBuilder.toString();
+    }
+    
+}
diff --git a/group24/121111914/src/com/github/ipk2015/coding2017/coderising/array/ArrayUtilTest.java b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/array/ArrayUtilTest.java
new file mode 100644
index 0000000000..2650717fc1
--- /dev/null
+++ b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/array/ArrayUtilTest.java
@@ -0,0 +1,73 @@
+package com.github.ipk2015.coding2017.coderising.array;
+
+import static org.junit.Assert.*;
+
+import java.util.Arrays;
+
+import org.junit.Before;
+import org.junit.Test;
+
+public class ArrayUtilTest {
+	ArrayUtil arrayUtil=new ArrayUtil();;
+	@Before
+	public void setUp() throws Exception {
+	}
+	private String toArrayString(int[] array){
+		return Arrays.toString(array).replaceAll(" ", "");
+	}
+	@Test
+	public void testReverseArray() {
+		int[] array=new int[]{1,3,5,9,16};
+		arrayUtil.reverseArray(array);
+		assertEquals("[16,9,5,3,1]",toArrayString(array));
+	}
+
+	@Test
+	public void testRemoveZero() {
+		int[] array=new int[]{1,0,3,0,0,0,5,9,16,0,0};
+		array=arrayUtil.removeZero(array);
+		assertEquals("[1,3,5,9,16]",toArrayString(array));
+	}
+
+	@Test
+	public void testMerge() {
+		int[] array1=new int[]{1,3,5,9,16};
+		int[] array2=new int[]{2,7,9,10,20};
+		
+		array1=arrayUtil.merge(array1, array2);
+		System.out.println(toArrayString(array1));
+		assertEquals("[1,2,3,5,7,9,10,16,20]",toArrayString(array1));
+	}
+
+	@Test
+	public void testGrow() {
+		int[] array=new int[]{1,3,5,9,16};
+		array=arrayUtil.grow(array,5);
+		assertEquals("[1,3,5,9,16,0,0,0,0,0]",toArrayString(array));
+	}
+
+	@Test
+	public void testFibonacci() {
+		int[] array=arrayUtil.fibonacci(20);
+		assertEquals("[1,1,2,3,5,8,13]",toArrayString(array));
+	}
+
+	@Test
+	public void testGetPrimes() {
+		int[] array=arrayUtil.getPrimes(20);
+		assertEquals("[2,3,5,7,11,13,17,19]",toArrayString(array));
+	}
+
+	@Test
+	public void testGetPerfectNumbers() {
+		int[] array=arrayUtil.getPerfectNumbers(10000);
+		assertEquals("[6,28,496,8128]",toArrayString(array));
+	}
+
+	@Test
+	public void testJoin() {
+		int[] array=new int[]{1,3,5,9,16};
+		assertEquals("1-3-5-9-16",arrayUtil.join(array, "-"));
+	}
+
+}
diff --git a/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/LoginAction.java b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/LoginAction.java
new file mode 100644
index 0000000000..4dff25cf3c
--- /dev/null
+++ b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/LoginAction.java
@@ -0,0 +1,41 @@
+package com.github.ipk2015.coding2017.coderising.litestruts;
+
+
+
+/**
+ * 这是一个用来展示登录的业务类， 其中的用户名和密码都是硬编码的。
+ * @author liuxin
+ *
+ */
+public class LoginAction{
+    private String name ;
+    private String password;
+    private String message;
+
+    public String getName() {
+        return name;
+    }
+
+    public String getPassword() {
+        return password;
+    }
+
+    public String execute(){
+            if("test".equals(name) && "1234".equals(password)){
+                this.message = "login successful";
+                return "success";
+            }
+            this.message = "login failed,please check your user/pwd";
+            return "fail";
+    }
+
+    public void setName(String name){
+        this.name = name;
+    }
+    public void setPassword(String password){
+        this.password = password;
+    }
+    public String getMessage(){
+        return this.message;
+    }
+}
diff --git a/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/Struts.java b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/Struts.java
new file mode 100644
index 0000000000..aa07bcc906
--- /dev/null
+++ b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/Struts.java
@@ -0,0 +1,107 @@
+package com.github.ipk2015.coding2017.coderising.litestruts;
+
+
+
+import java.lang.reflect.InvocationTargetException;
+import java.lang.reflect.Method;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Map.Entry;
+import java.util.Set;
+
+import org.dom4j.Document;
+import org.dom4j.DocumentException;
+import org.dom4j.Element;
+import org.dom4j.io.SAXReader;
+
+
+
+public class Struts {
+
+	
+    public static View runAction(String actionName, Map<String,String> parameters) throws Exception {
+
+        /*
+         
+		0. 读取配置文件struts.xml
+ 		
+ 		1. 根据actionName找到相对应的class ， 例如LoginAction,   通过反射实例化（创建对象）
+		据parameters中的数据，调用对象的setter方法， 例如parameters中的数据是 
+		("name"="test" ,  "password"="1234") ,     	
+		那就应该调用 setName和setPassword方法
+		
+		2. 通过反射调用对象的exectue 方法， 并获得返回值，例如"success"
+		
+		3. 通过反射找到对象的所有getter方法（例如 getMessage）,  
+		通过反射来调用， 把值和属性形成一个HashMap , 例如 {"message":  "登录成功"} ,  
+		放到View对象的parameters
+		
+		4. 根据struts.xml中的 <result> 配置,以及execute的返回值，  确定哪一个jsp，  
+		放到View对象的jsp字段中。
+        
+        */
+    	SAXReader reader=new SAXReader();
+    	Document document = reader.read("src/com/github/ipk2015/coding2017/coderising/litestruts/struts.xml");
+    	Element rootElement = document.getRootElement();
+    	
+    	Element actionElement=findElement(rootElement,"action","name",actionName);
+    	Class<?> armClass = Class.forName(actionElement.attributeValue("class"));
+    	Object newInstance = armClass.newInstance();
+    
+    	setParameters(armClass,newInstance,parameters);
+    	
+    	Method exectueMethod = armClass.getMethod("execute");
+    	String exectueMethodResult = (String) exectueMethod.invoke(newInstance);
+    	
+    	View view=new View();
+    	Map viewParameters = getViewParameters(armClass,newInstance);
+    	view.setParameters(viewParameters);
+    	
+    	Element resultElement=findElement(actionElement,"result","name",exectueMethodResult);
+    	view.setJsp(resultElement.getStringValue());
+    	
+    	return view;
+    }    
+
+    private static Element findElement(Element parent,String elementTag,String attributeName,String actionName){
+    	Element actionElement = null;
+    	String nameAttributeValue="";
+    	List<Element> elements = parent.elements(elementTag);
+    	for(Element element : elements){
+    		nameAttributeValue = element.attributeValue(attributeName);
+    		if(nameAttributeValue.equals(actionName)){
+    			actionElement=element;
+    			break;
+    		}
+    	}
+    	return actionElement;
+    }
+    private static void setParameters(Class armClass,Object newInstance,Map<String,String> parameters) throws Exception{
+    	Set<Entry<String, String>> entrySet = parameters.entrySet();
+    	String entryKey="";
+    	String firstLetter="";
+    	Method method=null;
+    	for(Entry<String,String> entry:entrySet){
+    		entryKey=entry.getKey();
+    		firstLetter=entryKey.substring(0, 1);
+    		entryKey=entryKey.replace(firstLetter,firstLetter.toUpperCase());
+    		method = armClass.getMethod("set"+entryKey, String.class);
+    		method.invoke(newInstance, entry.getValue());
+    	}
+    }
+    private static Map getViewParameters(Class armClass,Object newInstance) throws Exception{
+    	Map<String,String> map=new HashMap();
+    	Object getMethodReturn=null;
+    	String methodName="";
+    	Method[] methods = armClass.getMethods();
+    	for(int i=0;i<methods.length;i++){
+    		methodName=methods[i].getName();
+    		if(methodName.length()>3 && methodName.startsWith("get")){
+    			getMethodReturn=methods[i].invoke(newInstance);
+    			map.put(methodName.substring(3).toLowerCase(), getMethodReturn.toString());
+    		}
+    	}
+    	return map;
+    }
+}
diff --git a/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/StrutsTest.java b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/StrutsTest.java
new file mode 100644
index 0000000000..3f5f9bc98e
--- /dev/null
+++ b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/StrutsTest.java
@@ -0,0 +1,61 @@
+package com.github.ipk2015.coding2017.coderising.litestruts;
+
+
+
+import static org.junit.Assert.fail;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Set;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+
+
+
+
+public class StrutsTest {
+
+	@Test
+	public void testLoginActionSuccess() {
+		
+		String actionName = "login";
+        
+		Map<String,String> params = new HashMap<String,String>();
+        params.put("name","test");
+        params.put("password","1234");
+        
+        
+        View view = null;
+		try {
+			view = Struts.runAction(actionName,params);
+		} catch (Exception e) {
+			// TODO Auto-generated catch block
+			fail("发生异常");
+			e.printStackTrace();
+		}        
+        Assert.assertEquals("/jsp/homepage.jsp", view.getJsp());
+        Assert.assertEquals("login successful", view.getParameters().get("message"));
+	}
+
+	@Test
+	public void testLoginActionFailed() {
+		String actionName = "login";
+		Map<String,String> params = new HashMap<String,String>();
+        params.put("name","test");
+        params.put("password","123456"); //密码和预设的不一致
+        
+        View view = null;
+		try {
+			view = Struts.runAction(actionName,params);
+		} catch (Exception e) {
+			// TODO Auto-generated catch block
+			fail("发生异常");
+			e.printStackTrace();
+		}        
+        
+        Assert.assertEquals("/jsp/showLogin.jsp", view.getJsp());
+        Assert.assertEquals("login failed,please check your user/pwd", view.getParameters().get("message"));
+	}
+}
diff --git a/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/View.java b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/View.java
new file mode 100644
index 0000000000..26f7bddb17
--- /dev/null
+++ b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/View.java
@@ -0,0 +1,25 @@
+package com.github.ipk2015.coding2017.coderising.litestruts;
+
+
+
+import java.util.Map;
+
+public class View {
+	private String jsp;
+	private Map parameters;
+	
+	public String getJsp() {
+		return jsp;
+	}
+	public View setJsp(String jsp) {
+		this.jsp = jsp;
+		return this;
+	}
+	public Map getParameters() {
+		return parameters;
+	}
+	public View setParameters(Map parameters) {
+		this.parameters = parameters;
+		return this;
+	}
+}
diff --git a/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/struts.xml b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/struts.xml
new file mode 100644
index 0000000000..0c1df8c87c
--- /dev/null
+++ b/group24/121111914/src/com/github/ipk2015/coding2017/coderising/litestruts/struts.xml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<struts>
+    <action name="login" class="com.github.ipk2015.coding2017.coderising.litestruts.LoginAction">
+        <result name="success">/jsp/homepage.jsp</result>
+        <result name="fail">/jsp/showLogin.jsp</result>
+    </action>
+    <action name="logout" class="com.github.ipk2015.coding2017.coderising.litestruts.LogoutAction">
+    	<result name="success">/jsp/welcome.jsp</result>
+    	<result name="error">/jsp/error.jsp</result>
+    </action>
+</struts>
\ No newline at end of file