Merge pull request #11 from WANGCANCER/master

Struts和数据结构作业

group11/996108220/.classpath

@@ -2,5 +2,7 @@
 <classpath>
 	<classpathentry kind="src" path="src"/>
 	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.junit.JUNIT_CONTAINER/4"/>
+	<classpathentry kind="var" path="JUNIT" sourcepath="/JUNIT_SRC"/>
 	<classpathentry kind="output" path="bin"/>
 </classpath>

group11/996108220/src/com/coderising/array/ArrayUtil.java

@@ -0,0 +1,194 @@
+package com.coderising.array;
+
+import com.coding.basic.ArrayList;
+
+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 mid=origin.length%2==1?origin.length/2:origin.length/2-1;
+		for (int i = 0; i <= mid; i++) {
+			int vlaue=origin[i];
+			origin[i]=origin[origin.length-1-i];
+			origin[origin.length-1-i]=vlaue;
+		}
+	}
+
+	/**
+	 * 现在有如下的一个数组：   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){
+		ArrayList list=new ArrayList();
+		for (int i = 0; i < oldArray.length; i++) {
+			if (oldArray[i]!=0) {
+				list.add(oldArray[i]);
+			}
+		}
+		int[] array=new int[list.size()];
+		for (int i = 0; i < list.size(); i++) {
+			array[i]=(int) list.get(i);
+		}
+
+		return array;
+	}
+
+	/**
+	 * 给定两个已经排序好的整形数组， 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[] array=new int[array1.length+array2.length];
+		int ptr1=0;int ptr2=0;int index=0;
+		while (ptr1!=array1.length&&ptr2!=array2.length) {
+			array[index++]=array1[ptr1]>array2[ptr2]?array2[ptr2++]:array1[ptr1++];
+			}
+		if (ptr1==array1.length) {
+			for (int i = ptr2; i < array2.length; i++)array[index++]=array2[i];		
+		}
+		else {
+			for (int i = ptr1; i < array1.length; i++)array[index++]=array1[i];
+		}
+		return array;
+	}
+	/**
+	 * 把一个已经存满数据的数组 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 [] array=new int[oldArray.length+size];
+		for (int i = 0; i < oldArray.length; i++) {
+			array[i]=oldArray[i];
+		}
+		return array;
+	}
+
+	/**
+	 * 斐波那契数列为：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 null;
+		}
+		else if (max==2) {
+			return new int[]{1,1};
+		}
+		else {
+			ArrayList list=new ArrayList();
+			list.add(1);
+			list.add(1);
+			int next=2;
+			while (next<max) {
+				list.add(next);
+				next=(int)list.get(list.size()-1)+(int)list.get(list.size()-2);
+			}
+			int[] array=new int[list.size()];
+			for (int i = 0; i < list.size(); i++) {
+				array[i]=(int)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<=2) {
+			return null;
+		}
+		ArrayList list=new ArrayList();
+		list.add(2);
+		for (int i = 3; i < max; i++) {
+			int j = 2;
+			for (; j < Math.sqrt(i); j++) {
+				if (i%j==0) {
+					break;
+				}
+			}
+			if (i%j!=0) {
+				list.add(i);
+			}
+		}
+		int[] array=new int[list.size()];
+		for (int i = 0; i < array.length; i++) {
+			array[i]=(int) list.get(i);
+		}
+		return array;
+	}
+
+	/**
+	 * 所谓“完数”， 是指这个数恰好等于它的因子之和，例如6=1+2+3
+	 * 给定一个最大值max， 返回一个数组， 数组中是小于max 的所有完数
+	 * @param max
+	 * @return
+	 */
+	public int[] getPerfectNumbers(int max){
+		ArrayList list=new ArrayList();
+		for (int j = 2; j < max; j++) {
+			int value=0;
+			for (int i = 1; i < j; i++) {
+			if (j%i==0) {
+				value=value+i;
+				}
+			}
+			if (value==j) {
+				list.add(j);
+				}
+		}
+		if (list.size()!=0) {
+			int[] array=new int[list.size()];
+			for (int i = 0; i < array.length; i++) {
+				array[i]=(int)list.get(i);
+			}
+			return array;
+		}	
+		return null;
+	}
+
+	/**
+	 * 用seperator 把数组 array给连接起来
+	 * 例如array= [3,8,9], seperator = "-"
+	 * 则返回值为"3-8-9"
+	 * @param array
+	 * @param s
+	 * @return
+	 */
+	public String join(int[] array, String seperator){
+		String str=""+array[0];
+		for (int i = 1; i < array.length; i++) {
+			str=str+seperator+array[i];
+		}
+		return str;
+	}
+
+
+}

group11/996108220/src/com/coderising/array/ArrayUtilTest.java

@@ -0,0 +1,71 @@
+package com.coderising.array;
+import org.junit.Test;
+
+
+
+public class ArrayUtilTest {
+	ArrayUtil arrayUtil=new ArrayUtil();
+
+	@Test
+	public void testReverseArray() {
+		int[] array=new int[]{1,2,3,4,5};
+		arrayUtil.reverseArray(array);
+		for (int i = 0; i < array.length; i++) {
+			System.out.print(array[i]+" ");
+		}
+		//Assert.assertEquals(new int[]{5,4,3,2,1}, array);
+	}
+	@Test
+	public void testRemoveZero(){
+		int[] array=new int[]{1,3,4,5,0,0,6,6,0,5,4,7,6,7,0,5}  ;
+		int[] newarray=arrayUtil.removeZero(array);
+		for (int i = 0; i < newarray.length; i++) {
+			System.out.print(newarray[i]+" ");
+		}	
+	}
+	@Test
+	public void testMerge(){
+		int[] array1=new int[]{3, 5, 7,8,9,10};
+		int[] array2=new int[]{1,2,4};
+		int[] newarray=arrayUtil.merge(array1, array2);
+		for (int i = 0; i < newarray.length; i++) {
+			System.out.print(newarray[i]+" ");
+		}	
+	}
+	@Test
+	public void testGrow(){
+		int[] array=new int[]{1,3,4,5,0,0}  ;
+		int[] newarray=arrayUtil.grow(array, 4);
+		for (int i = 0; i < newarray.length; i++) {
+			System.out.print(newarray[i]+" ");
+		}	
+	}
+	@Test
+	public void testFibonacci(){
+		int[] newarray=arrayUtil.fibonacci(15);
+		for (int i = 0; i < newarray.length; i++) {
+			System.out.print(newarray[i]+" ");
+		}	
+	}
+	@Test
+	public void testGetPrimes(){
+		int[] newarray=arrayUtil.getPrimes(15);
+		for (int i = 0; i < newarray.length; i++) {
+			System.out.print(newarray[i]+" ");
+		}	
+	}
+	@Test
+	public void testGetPerfectNumbers(){
+		int[] newarray=arrayUtil.getPerfectNumbers(100);
+		for (int i = 0; i < newarray.length; i++) {
+			System.out.print(newarray[i]+" ");
+		}	
+	}
+	@Test
+	public void testJoin(){
+		int[] array=new int[]{1,3,4,5,0,0} ;
+		String s=arrayUtil.join(array,"&");
+		System.out.print(s);		
+	}
+
+}

group11/996108220/src/com/coderising/litestruts/Action.java

@@ -0,0 +1,11 @@
+package com.coderising.litestruts;
+
+public interface Action {
+
+    public String getName();
+    public String getPassword();
+    public String execute();
+    public void setName(String name);
+    public void setPassword(String password);
+    public String getMessage();
+}

group11/996108220/src/com/coderising/litestruts/ActionConfig.java

@@ -0,0 +1,44 @@
+/**
+ * 
+ */
+package com.coderising.litestruts;
+
+import java.util.HashMap;
+
+/**
+ * @author WANGCANCER
+ *
+ */
+public class ActionConfig {
+
+	    private	String actionName;
+	    private String clazzName;
+	    private	HashMap<String, String> messageToresult=null;
+		public String getActionName() {
+			return actionName;
+		}
+		public void setActionName(String actionName) {
+			this.actionName = actionName;
+		}
+		public String getClazzName() {
+			return clazzName;
+		}
+		public void setClazzName(String clazzName) {
+			this.clazzName = clazzName;
+		}
+		public HashMap<String, String> getMessageToresult() {
+			return messageToresult;
+		}
+		public void setMessageToresult(HashMap<String, String> messageToresult) {
+			this.messageToresult = messageToresult;
+		}
+		public ActionConfig(String actionName, String clazzName,
+				HashMap<String, String> messageToresult) {
+			super();
+			this.actionName = actionName;
+			this.clazzName = clazzName;
+			this.messageToresult = messageToresult;
+		}
+
+
+}

group11/996108220/src/com/coderising/litestruts/LoginAction.java

@@ -0,0 +1,40 @@
+package com.coderising.litestruts;
+
+
+/**
+ * 这是一个用来展示登录的业务类， 其中的用户名和密码都是硬编码的。
+ * @author liuxin
+ *
+ */
+public class LoginAction implements Action{
+    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;
+    }
+}