原题
Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element that appears only once.
Example 1:
Input: [1,1,2,3,3,4,4,8,8]
Output: 2
Example 2:
Input: [3,3,7,7,10,11,11]
Output: 10
代码分析
异或操作求单数。
代码实现
public int SingleNonDuplicate(int[] nums)
{
int rtn = nums[0];
for(int i=1; i<nums.Length;i++)
{
rtn ^= nums[i];
}
return rtn;
}