【LeetCode】136. Single Number 解题小结

题目：

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?

这题目的要求不仅是要求是线性时间，希望也不会使用额外的内存，那么也就是你无法运用其他的数据结构。也是参考了其他人的答案。对于位操作的特性还有待进一步挖掘。

class Solution {
public:int singleNumber(vector<int>& nums) {int num = 0;for (int i = 0; i < nums.size(); ++i){num ^= nums[i];}return num;}
};

转载于:https://www.cnblogs.com/Doctengineer/p/5824385.html

【LeetCode】136. Single Number 解题小结相关推荐

【异或】LeetCode 136. Single Number
LeetCode 136. Single Number Solution1:我的答案还好异或的性质没记错,还好,还好 class Solution { public:int singleNumber ...
[勇者闯LeetCode] 136. Single Number
[勇者闯LeetCode] 136. Single Number Description Given an array of integers, every element appears twice ...
Leetcode 136 Single Number 仅出现一次的数字
原题地址 https://leetcode.com/problems/single-number/ 题目描述 Given an array of integers, every element app ...
LeetCode 136. Single Number【哈希表/位运算/数学】简单
本文属于「征服LeetCode」系列文章之一,这一系列正式开始于2021/08/12.由于LeetCode上部分题目有锁,本系列将至少持续到刷完所有无锁题之日为止:由于LeetCode还在不断地创建新 ...
leetcode 136. Single Number
Given an array of integers, every element appears twice except for one. Find that single one. Note: ...
[swift] LeetCode 136. Single Number
Given an array of integers, every element appears twice except for one. Find that single one. Note: ...
【？异或】LeetCode 260. Single Number III
LeetCode 260. Single Number III Solution1: 博客转载自:http://www.cnblogs.com/grandyang/p/4741122.html 这道题 ...
【异或】LeetCode 137. Single Number II
LeetCode 137. Single Number II Solution1:不会做,抄的博客转载自:http://www.cnblogs.com/grandyang/p/4263927.htm ...
263.Ugly Number||202 happy number||476 Number Complement||136 Single Number
263.Ugly Number 判断因数是否只有素数2.3.5.. 感觉比较简单: class Solution(object):def isUgly(self, num):""& ...

【LeetCode】136. Single Number 解题小结

【LeetCode】136. Single Number 解题小结相关推荐

最新文章

热门文章