leetcode 136. Single Number
2016-11-23 19:53
323 查看
class Solution { public: int singleNumber(vector<int>& nums) { int x = 0; for(int i = 0;i < nums.size(); i++) x ^= nums[i]; return x; } };
相关文章推荐
- LeetCode 136:Single Number
- Leetcode刷题记——136. Single Number(单独的数字)
- LeetCode-136. Single Number 389. Find the Difference
- LeetCode - 136. Single Number
- LeetCode_136-Single Number
- [leetcode] 【数组】 136. Single Number
- leetcode 136. Single Number
- leetcode[136]Single Number
- LeetCode 136. Single Number
- LeetCode--136. Single Number
- Leetcode题解14 136. Single Number
- LeetCode 136. Single Number
- Leetcode #136 Single Number
- 【LeetCode-面试算法经典-Java实现】【136-Single Number(仅仅出现一次的数字)】
- [leetcode]--136. Single Number
- Leetcode--136.Single Number
- leetcode 136 single number
- LeetCode 136 Single Number
- [LeetCode]136. Single Number
- leetcode 136. Single Number