【LeetCode OJ 260】Single Number III

【LeetCode OJ 260】Single Number III

題目：Given an array of numbersnums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

For example:

Givennums = [1, 2, 1, 3, 2, 5], return[3, 5].

Note:

1. The order of the result is not important. So in the above example,[5, 3]is also correct.
2. Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity? 解題思路：題意為給定一個數組，只有兩個數字出現了一次，其它均出現了兩次，請找出這兩個出現了一次的數。題目要求算法的時間復雜度為線性的，空間復雜度為常量，本題給出了一個粗暴的解法： 代碼示例：

   public class Solution 
   {
   	 public int[] singleNumber(int[] nums)
   	 {
   		 int[] result=new int[2];
   		 List<integer> temp=new ArrayList<integer>();
   		 for(int i=0;i<nums.length;i++) else="" return="" pre="">
   
   
   </nums.length;i++)></integer></integer>