Given an 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?
public class Solution {
public int singleNumber(int[] nums) {
for(int i=1;i<nums.length;i++)
{
nums[i]^=nums[i-1];
}
return nums[nums.length-1];
}
}
看大神解题方法中另外还有一种很简单的方法,是使用java8 storm流的特性 reduce方法解决,这里就不再叙述了