From 4dd832cef6647baf94adaa39eec774bde46204b4 Mon Sep 17 00:00:00 2001
From: sjlv <1258890344@qq.com>
Date: Sun, 19 Mar 2017 12:18:12 +0800
Subject: [PATCH] =?UTF-8?q?ArrayUtil=E5=92=8CStruts=E5=B0=8F=E7=A8=8B?=
 =?UTF-8?q?=E5=BA=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../src/com/coderising/array/ArrayUtil.java   | 209 ++++++++++++++++++
 .../com/coderising/array/ArrayUtilTest.java   |  88 ++++++++
 .../coderising/litestruts/LoginAction.java    |  39 ++++
 .../src/com/coderising/litestruts/Struts.java | 136 ++++++++++++
 .../com/coderising/litestruts/StrutsTest.java |  47 ++++
 .../src/com/coderising/litestruts/View.java   |  23 ++
 .../src/com/coderising/litestruts/struts.xml  |  11 +
 7 files changed, 553 insertions(+)
 create mode 100644 group22/1258890344/src/com/coderising/array/ArrayUtil.java
 create mode 100644 group22/1258890344/src/com/coderising/array/ArrayUtilTest.java
 create mode 100644 group22/1258890344/src/com/coderising/litestruts/LoginAction.java
 create mode 100644 group22/1258890344/src/com/coderising/litestruts/Struts.java
 create mode 100644 group22/1258890344/src/com/coderising/litestruts/StrutsTest.java
 create mode 100644 group22/1258890344/src/com/coderising/litestruts/View.java
 create mode 100644 group22/1258890344/src/com/coderising/litestruts/struts.xml

diff --git a/group22/1258890344/src/com/coderising/array/ArrayUtil.java b/group22/1258890344/src/com/coderising/array/ArrayUtil.java
new file mode 100644
index 0000000000..773b66ffb7
--- /dev/null
+++ b/group22/1258890344/src/com/coderising/array/ArrayUtil.java
@@ -0,0 +1,209 @@
+package com.coderising.array;
+
+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 length=origin.length;
+		int value=0;
+		for(int i=0;i<(length/2);i++){
+			value=origin[i];
+			origin[i]=origin[length-1-i];
+			origin[length-1-i]=value;
+			
+		}
+	}
+	
+	/**
+	 * 现在有如下的一个数组：   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 length=oldArray.length;
+		int[] newArray = new int[length];
+		int j=0;
+		for(int i=0;i<length;i++){
+			if(oldArray[i]==0){
+				continue;
+			}
+			newArray[j]=oldArray[i];
+			j++;
+		}
+		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){
+		int length1=array1.length;
+		int length2=array2.length;
+		int[] array3=Arrays.copyOf(array1,length1+length2 );
+		int j=0;
+		for(int i=0;i<(length1+length2);i++){
+				if(array3[i]>array2[j]){
+					for(int k=length1;k>i;k--){
+						array3[k]=array3[k-1];
+					}
+					array3[i]=array2[j];
+					j++;
+					if(j<length2){
+						continue;
+					}
+					return array3;
+				}else if(array3[i]<array2[j]){
+					if(array3[i]==0){
+						array3[i]=array2[j];
+						j++;
+					}
+					if(j<length2){
+						continue;
+					}
+					return array3;
+				}else{
+					j++;
+					if(j<length2){
+						continue;
+					}
+					return array3;
+				}
+		}
+		return  array3;
+	}
+	/**
+	 * 把一个已经存满数据的数组 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 length=oldArray.length;
+		int [] newArray=Arrays.copyOf(oldArray, length+size);
+	    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){
+		int[] array=new int[max];
+		if(max==1){
+			return array;
+		}
+		if(max>1){
+			array[0]=1;
+			array[1]=1;
+			for(int i=2;i>1;i++){
+				array[i]=array[i-1]+array[i-2];
+				if(array[i]>=max){
+					array[i]=0;
+					return  array;
+				}
+			}
+		}
+		return array;
+		
+		
+	}
+	
+	/**
+	 * 返回小于给定最大值max的所有素数数组
+	 * 例如max = 23, 返回的数组为[2,3,5,7,11,13,17,19]
+	 * @param max
+	 * @return
+	 */
+	public int[] getPrimes(int max){
+		
+		int[] array=new int[max];
+		int k=0;
+		if(max==2){
+			array[0]=2;
+		}
+		for(int i=3;i<max;i++){
+			Boolean flag=true;
+			for(int j=2;j<i;j++){
+				if(i%j==0){
+					flag=false;
+					break;
+				}
+			}
+			if(flag){
+					array[k]=i;
+					k++;
+			}
+		}
+		return array;
+	}
+	
+	/**
+	 * 所谓“完数”， 是指这个数恰好等于它的因子之和，例如6=1+2+3
+	 * 给定一个最大值max， 返回一个数组， 数组中是小于max 的所有完数
+	 * @param max
+	 * @return
+	 */
+	public int[] getPerfectNumbers(int max){
+		int[] array=new int[max/2];
+		int k=0;
+		for(int i=1;i<max;i++){
+			int sum=0;
+			for(int j=1;j<i;j++){
+				if(i%j==0){
+					sum+=j;
+					continue;
+				}
+			}
+			if(sum==i){
+				array[k]=sum;
+				k++;
+				continue;
+			}
+		}
+		return array;
+	}
+	
+	/**
+	 * 用seperator 把数组 array给连接起来
+	 * 例如array= [3,8,9], seperator = "-"
+	 * 则返回值为"3-8-9"
+	 * @param array
+	 * @param s
+	 * @return
+	 */
+	public String join(int[] array, String seperator){
+		int length=array.length;
+		String string="";
+		for(int i=0;i<length;i++){
+			string+=array[i]+seperator;
+			if(i==length-1){
+				string+=array[i];
+			}
+			
+		}
+		return string;
+	}
+	
+
+}
diff --git a/group22/1258890344/src/com/coderising/array/ArrayUtilTest.java b/group22/1258890344/src/com/coderising/array/ArrayUtilTest.java
new file mode 100644
index 0000000000..5e7040c036
--- /dev/null
+++ b/group22/1258890344/src/com/coderising/array/ArrayUtilTest.java
@@ -0,0 +1,88 @@
+package com.coderising.array;
+
+import static org.junit.Assert.*;
+
+import org.junit.After;
+import org.junit.Before;
+import org.junit.Test;
+
+public class ArrayUtilTest {
+	private static ArrayUtil a=new ArrayUtil();
+
+	@Before
+	public void setUp() throws Exception {
+	}
+
+	@After
+	public void tearDown() throws Exception {
+	}
+
+	@Test
+	public void testReverseArray() {
+		int[] array={3,5,7,9};
+		a.reverseArray(array);
+		for(int i=0;i<array.length;i++){
+			System.out.println(array[i]);
+		}
+	}
+
+	@Test
+	public void testRemoveZero() {
+		int oldArr[]={1,0,6,0,5,7,0};
+		int newArr[]=a.removeZero(oldArr);
+		for(int i=0;i<newArr.length;i++){
+			System.out.println(newArr[i]);
+		}
+	}
+
+	@Test
+	public void testMerge() {
+		int[] a1 = {3, 5, 7,8};
+		int[] a2 = {4, 8, 9,11,19,20};
+		int[] a3=a.merge(a1, a2);
+		for(int i=0;i<a3.length;i++){
+			System.out.println(a3[i]);
+		}
+	}
+
+	@Test
+	public void testGrow() {
+		int oldArr[]={1,0,6,0,5,7,0};
+		int newArr[]=a.grow(oldArr, 5);
+		System.out.println(newArr.length);
+	}
+
+	@Test
+	public void testFibonacci() {
+		int newArr[]=a.fibonacci(1);
+		for(int i=0;i<newArr.length;i++){
+			System.out.println(newArr[i]);
+		}
+	}
+
+	@Test
+	public void testGetPrimes() {
+		int newArr[]=a.getPrimes(2);
+		for(int i=0;i<newArr.length;i++){
+			System.out.println(newArr[i]);
+		}
+	}
+
+	@Test
+	public void testGetPerfectNumbers() {
+		int newArr[]=a.getPerfectNumbers(100);
+		for(int i=0;i<newArr.length;i++){
+			System.out.println(newArr[i]);
+		}
+	}
+
+	@Test
+	public void testJoin() {
+		int oldArr[]={1,0,6,0,5,7,0};
+		String result=a.join(oldArr, "-");
+		System.out.println(result);
+
+
+	}
+
+}
diff --git a/group22/1258890344/src/com/coderising/litestruts/LoginAction.java b/group22/1258890344/src/com/coderising/litestruts/LoginAction.java
new file mode 100644
index 0000000000..dcdbe226ed
--- /dev/null
+++ b/group22/1258890344/src/com/coderising/litestruts/LoginAction.java
@@ -0,0 +1,39 @@
+package com.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/group22/1258890344/src/com/coderising/litestruts/Struts.java b/group22/1258890344/src/com/coderising/litestruts/Struts.java
new file mode 100644
index 0000000000..368b64f64c
--- /dev/null
+++ b/group22/1258890344/src/com/coderising/litestruts/Struts.java
@@ -0,0 +1,136 @@
+package com.coderising.litestruts;
+
+import java.lang.reflect.Method;
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.Iterator;
+import java.util.LinkedHashMap;
+import java.util.List;
+import java.util.Map;
+
+import org.dom4j.Attribute;
+import org.dom4j.Document;
+import org.dom4j.Element;
+import org.dom4j.io.SAXReader;
+
+
+
+public class Struts {
+	
+
+    public static View runAction(String actionName, Map<String,String> parameters) {
+
+        /*
+         
+		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字段中。
+        
+        */
+    	View view=new View();
+    	try {
+    		SAXReader reader=new SAXReader();
+			Document doc=reader.read("./src/com/coderising/litestruts/struts.xml");
+			Element root=doc.getRootElement();
+			List<Element> list=root.elements();//将所有元素放到集合中
+			List<Map<String,String>> listMap=getElements(list);
+			int size=listmap.size();
+			listMap.remove(size-1);
+			System.out.println(listMap.toString());
+			
+			String pathName="";
+			int index=0;
+			String name=parameters.get("name");
+			String password=parameters.get("password");
+			
+			Map<String,Object> parameter=new HashMap<>();
+			
+			for(int i=0;i<size;i++){
+				pathName=listMap.get(i).get(actionName);
+				if(pathName!=null){
+					index=i;
+					break;
+				}
+				
+			}
+			Class clz=Class.forName(pathName);
+			Object obj=clz.newInstance();
+			Method setName=clz.getDeclaredMethod("setName", String.class);
+			Method setPassword=clz.getDeclaredMethod("setPassword", String.class);
+			Method execute=clz.getDeclaredMethod("execute");
+			Method getMessage=clz.getDeclaredMethod("getMessage");
+			setName.invoke(obj, name);
+			setPassword.invoke(obj, password);
+			
+			Object result=execute.invoke(obj);
+			Object message=getMessage.invoke(obj);
+			
+			parameter.put("message", message);
+			view.setParameters(parameter);
+			
+			String jsp=listMap.get(index).get(result);
+			view.setJsp(jsp);
+		} catch (Exception e) {
+			// TODO Auto-generated catch block
+			e.printStackTrace();
+		}
+    	return view;
+    }    
+
+    
+    private static List<Map<String,String>> listmap = new ArrayList<Map<String,String>>();
+    private static Map<String,String> map=new LinkedHashMap<String,String>();
+    private static List<Map<String,String>> getElements(List<Element> list){
+    	
+    	for(Iterator<Element> itera1=list.iterator();itera1.hasNext();){
+    		String key="";
+			String value="";
+    		//获取action、result
+    		Element element=itera1.next();
+    		if(element.getName()=="action"){
+    			map = new LinkedHashMap<String,String>();
+    		}
+    		if(element.getText().trim()!=null){
+    			value=element.getText();
+    		}
+    		List<Attribute> attributes=element.attributes();
+    		
+    		
+    		//获取action、result里的属性名和值
+    		for(Iterator<Attribute> itera2=attributes.iterator();itera2.hasNext();){
+    			Attribute attr=itera2.next();
+    			
+    			if(attr.getName().equals("name")){
+    				key=attr.getValue();
+    			}
+    			if(attr.getName().equals("class")){
+    				value=attr.getValue();
+    				
+    			}
+    			if(!key.trim().isEmpty()&&!value.trim().isEmpty()){
+    				map.put(key, value);
+    			}
+    		}
+    		
+    		List<Element> subList=element.elements();
+    		//递归action的的子元素们 
+    		if(subList.size()!=0){
+    			getElements(subList);
+    		}
+    	}
+    	listmap.add(map);
+		return listmap;
+    }
+}
diff --git a/group22/1258890344/src/com/coderising/litestruts/StrutsTest.java b/group22/1258890344/src/com/coderising/litestruts/StrutsTest.java
new file mode 100644
index 0000000000..ff10b5dd33
--- /dev/null
+++ b/group22/1258890344/src/com/coderising/litestruts/StrutsTest.java
@@ -0,0 +1,47 @@
+package com.coderising.litestruts;
+
+import java.util.HashMap;
+import java.util.Map;
+
+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  = Struts.runAction(actionName,params);     
+        System.out.println( view.getJsp());
+        System.out.println( view.getParameters().get("message"));
+        
+//        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  = Struts.runAction(actionName,params);        
+        
+//        System.out.println( view.getJsp());
+//        System.out.println( view.getParameters().get("message"));
+        Assert.assertEquals("/jsp/showLogin.jsp", view.getJsp());
+        Assert.assertEquals("login failed,please check your user/pwd", view.getParameters().get("message"));
+	}
+}
diff --git a/group22/1258890344/src/com/coderising/litestruts/View.java b/group22/1258890344/src/com/coderising/litestruts/View.java
new file mode 100644
index 0000000000..07df2a5dab
--- /dev/null
+++ b/group22/1258890344/src/com/coderising/litestruts/View.java
@@ -0,0 +1,23 @@
+package com.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/group22/1258890344/src/com/coderising/litestruts/struts.xml b/group22/1258890344/src/com/coderising/litestruts/struts.xml
new file mode 100644
index 0000000000..171848ecd1
--- /dev/null
+++ b/group22/1258890344/src/com/coderising/litestruts/struts.xml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<struts>
+    <action name="login" class="com.coderising.litestruts.LoginAction">
+        <result name="success">/jsp/homepage.jsp</result>
+        <result name="fail">/jsp/showLogin.jsp</result>
+    </action>
+    <action name="logout" class="com.coderising.litestruts.LogoutAction">
+    	<result name="success">/jsp/welcome.jsp</result>
+    	<result name="error">/jsp/error.jsp</result>
+    </action>
+</struts>