题:https://leetcode.com/problems/single-number/description/
题目
Given a non-empty 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?
Example 1:
Input: [2,2,1]
Output: 1
Example 2:
Input: [4,1,2,1,2]
Output: 4
思路
设置一个set和singleone=0,遍历nums 。
若当前i 未在set中,singleone += i,否则 singleone -= i。
遍历结束,singleone就是所求值。
Solution
https://leetcode.com/problems/single-number/solution/
还可参考 Solution 的思路
code
class Solution:
def singleNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
singleone = 0
s = set()
for i in nums:
if i not in s:
singleone +=i
else:
singleone -=i
s.add(i)
return singleone