leetcode--Single Number
2018-02-26 22:37
337 查看
int singleNumber(int* nums, int numsSize) {
int k=nums[0];
for(int i=1;i<numsSize;i++){//这里要注意不能从i=0开始遍历，因为k再被与运算一次结果就会出错
k=(k^nums[i]);
}
return k;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [leetcode]--136. Single Number
- [Leetcode] single number 找单个数
- LeetCode Problem 136:Single Number
- leetcode 136. Single Number
- LeetCode 136. Single Number
- LeetCode题解：Single Number
- leetcode || 136、Single Number
- [leetcode] 136. Single Number
- [LeetCode]Single Number
- LeetCode——Single Number
- [Leetcode] Single Number
- LeetCode学习（4）Single Number
- leetCode:Single Number
- 【LeetCode】136.Single Number_EASY(十)
- leetcode-Single Number
- LeetCode -- Single Number
- Single Number(leetcode)
- [LeetCode] Single Number
- [LeetCode#136, 137]Single Number, Single Number 2
- LeetCode 136. Single Number