您的位置:首页 > 其它

Find that single one.(linear runtime complexity0

2015-11-18 15:34 363 查看
public class Solution {
public int singleNumber(int[] nums) {

int temp = 0;
for (int i=0;i<nums.length;i++)
{
temp = temp^nums[i];
}
return temp;
}
}


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?

Subscribe to see which companies asked this question

相异为1;找到相等的部分;为1的部分是不同的·
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: