Given a non-empty array of integers, every element appears twice except for one. Find that single one.
Input: [2,2,1]
Output: 1
题目是找出列表中只出现一次的数。其他数均出现两次。
初始话一个字典用来储存出现次数。最后找到dic.value为1的`dic.key.
class Solution:
def singleNumber(self, nums: List[int]) -> int:
dic={e:2 for e in nums}
for e in nums:
dic[e] -= 1
return list(dic.keys())[list(dic.values()).index(1)]
list(dic.keys())和list(dic.values())分别返回key 和 value的列表
136. Single Number https://leetcode.com/problems/single-n...
D51 136. Single Number 题目链接 136. Single Number 题目分析 返回给定数...
136. Single Number Description Given a non-empty array of...
Given an array of integers, every element appears twice e...
Given an array of integers, every element appears twice e...
Given an array of integers, every element appears twice e...
Given an array of integers, every element appears twice e...
Given an array of integers, every element appears twice e...
题目 Given a non-empty array of integers, every element app...
136. Single Number Given an array of integers, every elem...
本文标题：[leetcode]136. Single Number
本文链接：https://www.haomeiwen.com/subject/ghkerctx.html
网友评论