@@ -0,0 +1,853 @@
+/* *%0A * Given an array of integers, every element appears twice except for one. Find that single one.%0A *%0A * Note:%0A *      Your algorithm should have a linear runtime complexity. %0A *      Could you implement it without using extra memory?%0A */%0A %0A/* *%0A * I can't figure out the solution without using the extra memory. This problem can be solved with hash map.%0A *%0A * The code below is modified from --%0A *          http://www.programcreek.com/2012/12/leetcode-solution-of-single-number-in-java%0A */%0A %0A/* *%0A * @auther = Chi Chen%0A * @email = chenchiapply@gmail.com%0A * @note = modified from X Wang%0A */%0A %0Apublic class SingleNumber %7B%0A  public static void main(String%5B%5D args) %7B%0A  %0A  %7D%0A  %0A  public static int singleNumber(int%5B%5D A) %7B%0A    int single_num = 0;%0A    %0A    for(int num : A)%7B%0A      single_num = single_num %5E num;%0A    %7D%0A        %0A    return single_num;%0A  %7D%0A%7D%0A

Create SingleNumber.java