@@ -0,0 +1,756 @@
+/**%0A * Author : Laberat%0A * Date   : 16/2/2.%0A * Link   : https://leetcode.com/problems/single-number/%0A * Number : # 136%0A * Desc   : Given an array of integers, every element appears twice except for one.%0A *          Find that single one.%0A *          Your algorithm should have a linear runtime complexity.%0A *          Could you implement it without using extra memory?%0A */%0Apublic class SingleNumber %7B%0A    public int singleNumber(int%5B%5D nums) %7B%0A        int result = 0;%0A        for (int i : nums) %7B%0A            result %5E= i;%0A        %7D%0A        return result;%0A    %7D%0A%0A    public static void main() %7B%0A        int%5B%5D nums = %7B1,2,3,1,2,3,4%7D;%0A        SingleNumber s = new SingleNumber();%0A        int res = s.singleNumber(nums);%0A        System.out.println(res);%0A    %7D%0A%7D%0A

solve #136