Merge pull request #20 from onlyLYJ/master

Array Exercise & Test

group12/382266293/.classpath

@@ -1,7 +1,9 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<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="output" path="bin"/>
-</classpath>
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" path="src"/>
+	<classpathentry kind="src" path="coding/basic"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.junit.JUNIT_CONTAINER/4"/>
+	<classpathentry kind="lib" path="lib/dom4j-1.6.1.jar" sourcepath="lib/dom4j-1.6.1.zip"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

group12/382266293/src/TestCollection/StackTest.java → group12/382266293/coding/basic/TestCollection/StackTest.java

@@ -104,13 +104,22 @@ public void testSize() {
 
 	@Test
 	public void testAdd() {
-		myStack.push(5);
-		myStack.push(10);
-		myStack.push(15);
-		println(myStack.get(0));
-		println(myStack.get(1));
-		println(myStack.get(2));
+
+		int size = getRandomNumber();
+		int[] expected = new int[size];
+		int actual;
+		for (int i = 0; i < size; i++) {
+			actual = getRandomNumber();
+			expected[i] = actual;
+			myStack.add(actual);
+		}
 
+		int expectedInt;
+		for (int i = 0; i < size; i++) {
+			expectedInt = expected[size - i - 1];
+			actual = myStack.pop();
+			assertEquals(expectedInt, actual);
+		}
 	}
 
 	@Test

group12/382266293/src/util/Print.java → group12/382266293/coding/basic/util/Print.java

@@ -1,5 +1,6 @@
 package util;
 
+import java.util.Arrays;
 
 public class Print {
 
@@ -10,5 +11,10 @@ public static void print(Object o){
 	public static void println(Object o){
 		System.out.println(o);
 	}
+
+	public static void printArr(int[] arr) {	
+		println(Arrays.toString(arr));
+	}
+
 
 }

group12/382266293/src/util/TestUtil.java → group12/382266293/coding/basic/util/TestUtil.java

@@ -1,5 +1,6 @@
 package util;
 
+import java.util.Arrays;
 import java.util.Random;
 
 import Collection.List;
@@ -16,10 +17,24 @@ public class TestUtil<E> extends TestCase {
 	private static final int RANDOM_SIZE = 500;
 
 
+
+
+	public static int[] getRandomIntArray(int number) {
+		int[] arr = new int[number];
+		for (int i = 0; i < arr.length; i++) {
+			arr[i] = getRandomNumber() + 1;
+		}
+		return arr;
+	}
+
 	public static int getRandomNumber() {
 		return random.nextInt(RANDOM_SIZE);
 	}
 
+	public static int getRandomNumber(int bound) {
+		return random.nextInt(bound);
+	}
+
 	public static void addIntWithNatureOrder(List<Integer> myList, int numbers) {
 
 		for (int acutal = 0; acutal < numbers ; acutal++) {

group12/382266293/lib/.gitignore

@@ -0,0 +1 @@
+/dom4j-1.6.1.zip

group12/382266293/src/TestDom4J.java

@@ -0,0 +1,59 @@
+import java.net.URL;
+import java.util.Iterator;
+import java.util.List;
+
+import org.dom4j.Attribute;
+import org.dom4j.Document;
+import org.dom4j.DocumentException;
+import org.dom4j.Element;
+import org.dom4j.Node;
+import org.dom4j.io.SAXReader;
+
+import static util.Print.*;
+
+public class TestDom4J {
+
+    public Document parse(String add) throws DocumentException {
+        SAXReader reader = new SAXReader();
+        Document document = reader.read(add);
+        return document;
+    }
+
+
+
+    public void bar(Document document) {
+        List list = document.selectNodes( "/struts-config/action-mappings/action" );
+        Node node = document.selectSingleNode( "/struts-config/action-mappings/action/forward" );
+
+        String name = node.valueOf( "@name" );
+        println(name);
+    }
+
+    public void listNodes(Element node){  
+        System.out.println("当前节点的名称：" + node.getName());  
+        //首先获取当前节点的所有属性节点  
+        List<Attribute> list = node.attributes();  
+        //遍历属性节点  
+        for(Attribute attribute : list){  
+            System.out.println("属性"+attribute.getName() +":" + attribute.getValue());  
+        }  
+        //如果当前节点内容不为空，则输出  
+        if(!(node.getTextTrim().equals(""))){  
+             System.out.println( node.getName() + "：" + node.getText());    
+        }  
+        //同时迭代当前节点下面的所有子节点  
+        //使用递归  
+        Iterator<Element> iterator = node.elementIterator();  
+        while(iterator.hasNext()){  
+            Element e = iterator.next();  
+            listNodes(e);  
+        }  
+    }  
+
+    public static void main(String args[]) throws DocumentException {
+
+
+
+    }
+
+}

group12/382266293/src/array/ArrayUtil.java

@@ -0,0 +1,235 @@
+package array;
+
+import static util.Print.*;
+import java.util.Arrays;
+import java.util.BitSet;
+import Collection.Iterator;
+import Collection.Concrete.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 temp;
+		int index = origin.length - 1;
+		int numbersToReverse = origin.length/2;
+		for (int i = 0; i < numbersToReverse ; i++) {
+			temp = origin[i];
+			origin[i] = origin[index - i];
+			origin[index - i] = 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){
+
+		BitSet check = new BitSet(oldArray.length);
+		boolean isZero;
+		for (int i = 0; i < oldArray.length; i++) {
+			isZero = (oldArray[i] == 0) ? true : false;
+			check.set(i, isZero);
+		}
+
+		int newSize = oldArray.length-check.cardinality();
+		int[] newArr = new int[newSize];
+
+		int nextIndex = check.nextClearBit(0);
+		for(int i = 0 ; i < newSize ; i++) {
+			newArr[i] = oldArray[nextIndex];
+			nextIndex = check.nextClearBit(nextIndex+1);
+		}
+
+		return newArr;
+	}
+
+
+	/**
+	 * 给定两个已经排序好的整形数组， 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 len1 = array1.length;
+		int len2 = array2.length;
+		int len3 = array1[len1-1] < array2[len2-1] ? array2[len2-1] + 1: array1[len1-1] + 1; 
+		int[] newArr = new int[len3];
+		initialArray(newArr, -1);
+		for (int i = 0; i < len1; i++) {
+			newArr[array1[i]] = 0;
+		}
+		for (int i = 0; i < len2; i++) {
+			newArr[array2[i]] = 0;
+		}
+		int mergedLength = 0;
+		for (int i = 0; i < len3; i++) {
+			if (newArr[i] != -1)
+				newArr[mergedLength++] = i;
+		}
+		return Arrays.copyOf(newArr, mergedLength);
+	}
+
+	public static void initialArray(int[] arr, int j) {
+		for (int i = 0; i < arr.length; i++) {
+			arr[i] = j;
+		}
+	}
+
+	/**
+	 * 把一个已经存满数据的数组 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[] newArr = new int[oldArray.length + size];
+		for (int i = 0; i < oldArray.length; i++) {
+			newArr[i] = oldArray[i];
+		}
+		return newArr;
+	}
+
+
+	/**
+	 * 斐波那契数列为：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];
+		int[] result = new int[max];
+		result[0] = result[1] = 1;
+		int count = 0;
+		for (int i = 2, j = 0; j < max ; i++) {
+			result[i] = result[i-1] + result[i-2];
+			j = result[i];
+			count++;
+		}
+		return Arrays.copyOf(result, ++count);
+	}
+
+	/**
+	 * 返回小于给定最大值max的所有素数数组
+	 * 例如max = 23, 返回的数组为[2,3,5,7,11,13,17,19]
+	 * @param max
+	 * @return
+	 */
+	public int[] getPrimes(int max){
+
+		String temp = "";
+		for(int i = 0; i < max; i++) {
+			if(isPrime(i)) {
+				temp += i + " ";
+			}
+		}
+		String[] tempArr = temp.split(" ");
+		int[] result = new int[tempArr.length];
+		for (int i = 0; i < result.length; i++) {
+			result[i] = Integer.parseInt(tempArr[i]);
+		}
+
+		return result;
+	}
+
+	public static boolean isPrime(int num) {
+
+		if (num <= 1)
+			return false;
+
+		if (num == 2)
+			return true;
+
+		for(int i = 2; i <= Math.sqrt(num) + 1; i++) {
+			if (num % i == 0)
+				return false;
+		}
+
+		return true;
+	}
+
+
+	/**
+	 * 所谓“完数”， 是指这个数恰好等于它的因子之和，例如6=1+2+3
+	 * 给定一个最大值max， 返回一个数组， 数组中是小于max 的所有完数
+	 * @param max
+	 * @return
+	 */
+	public int[] getPerfectNumbers(int max){
+
+		int count = 0;
+		ArrayList<Integer> myList = new ArrayList<Integer>();
+		for(int i = 1; i < max; i++) {
+			if(isPerfectNum(i)) {
+				count++;
+				myList.add(i);
+			}
+		}
+		int[] result = new int[count]; 
+		Iterator<Integer> iterator = myList.iterator();
+		for (int i = 0; i < count; i++) {
+			result[i] = iterator.next();
+		}
+		return result;
+	}
+
+
+	public static boolean isPerfectNum(int num) {
+
+		int sum = 0;
+		for (int i = 1; i <= num/2; i++) {
+			if (num % i == 0)
+				sum += i;
+		}
+
+		return (num == sum) ? true : false;
+
+	}
+
+
+	/**
+	 * 用seperator 把数组 array给连接起来
+	 * 例如array= [3,8,9], seperator = "-"
+	 * 则返回值为"3-8-9"
+	 * @param array
+	 * @param s
+	 * @return
+	 */
+	public String join(int[] array, String seperator){
+		StringBuilder sb = new StringBuilder();
+		for (int i = 0; i < array.length; i++) {
+			sb.append(array[i]);
+			if (i < array.length-1)
+				sb.append(seperator);
+		}
+		return sb.toString();
+	}
+
+
+}