136. Single Number
2016-11-04 18:38
204 查看
Given an array of integers, every element appears
twice except for one. Find that single one.
思路：所有數 ＸＯＲ起來，剩下的就是孤單的那一個了
class Solution {
public:
int singleNumber(vector<int>& nums) {
int ret = 0;
for (int index = 0; index < nums.size(); index++){
ret ^= nums[index];
}
return ret;
}
};
twice except for one. Find that single one.
思路：所有數 ＸＯＲ起來，剩下的就是孤單的那一個了
class Solution {
public:
int singleNumber(vector<int>& nums) {
int ret = 0;
for (int index = 0; index < nums.size(); index++){
ret ^= nums[index];
}
return ret;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 136 Single Number
- [LeetCode]136 Single Number
- leetcode || 136、Single Number
- LeetCode 136. Single Number
- 136.Single Number
- Java [Leetcode 136]Single Number
- leetcode——136——Single Number
- [136] Single Number
- [leetcode] 136. Single Number
- 136 Single Number
- [ LeetCode ] - 136. Single Number 解答
- [LeetCode]--136. Single Number
- leetcode136: Single Number
- leetcode-136. Single Number
- LeetCode 136. Single Number
- Leetcode——136. Single Number
- [leetcode]--136. Single Number
- 136. Single Number
- leetcode 136. Single Number
- LeetCode 136. Single Number