Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Example 1: ``` Input: [2,2,1] Output: 1 ``` Example 2: ``` Input: [4,1,2,1,2] Output: 4 ``` ``` // 如果a、b兩個值不相同，則異或結果為1。如果a、b兩個值相同，異或結果為0。 // 利用0和任何數異或都為該數定理 var singleNumber = function(nums) { sum=0; for(var i=0;i<nums.length;i++){ sum^=nums[i]; } return sum; }; ```