LeetCode 136. Single Number (算法、异或)
2017-05-23 10:39
381 查看
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?
输入一组整数如[1,1,2,3,3],几乎所有数都出现两次,只有一个数出现一次,找出这个数。
思路:异或。A xor A = 0, A xor B xor A = B
for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
输入一组整数如[1,1,2,3,3],几乎所有数都出现两次,只有一个数出现一次,找出这个数。
思路:异或。A xor A = 0, A xor B xor A = B
class Solution { public: int singleNumber(vector<int>& nums) { int ans=nums[0]; for(int i=1;i<nums.size();i++) ans = ans xor nums[i]; return ans; } };
相关文章推荐
- 【LeetCode-面试算法经典-Java实现】【137-Single Number II(只字出一次的数字II)】
- 【LeetCode-面试算法经典-Java实现】【200-Number of Islands(岛的数目)】
- 【python】【leetcode】【算法题目9—Palindrome Number】
- LeetCode算法题目:Number of Digit One
- 算法分析与设计课程(19):【leetcode】Ugly Number II
- [算法][LeetCode]Single Number——异或运算的巧妙运用
- Leetcode算法学习日志-447 Number of Boomerangs
- 【leetcode73】经典算法-Guess Number Higher or Lower
- LeetCode 136. Single Number 解题报告
- Leetcode算法学习日志-452 Minimum Number of Arrows to Burst Balloons
- [leetcode] 136. Single Number 解题报告
- 【leetcode73】经典算法-Guess Number Higher or Lower
- leetcode 136. Single Number 复杂方法
- 算法Week11.01 - LeetCode 452. Minimum Number of Arrows to Burst Balloons
- Leetcode 136. Single Number
- 【LeetCode-面试算法经典-Java实现】【171-Excel Sheet Column Number(Excel表行号)】
- LeetCode - 136. Single Number
- 【leetcode73】经典算法-Guess Number Higher or Lower
- [leetcode]136. Single Number
- LeetCode 136. Single Number (落单的数)