Leetcode #260 Single Number III
来源:互联网 发布:上海知恩服饰有限公司 编辑:程序博客网 时间:2024/05/01 09:02
Given an array of numbers nums
, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
For example:
Given nums = [1, 2, 1, 3, 2, 5]
, return [3, 5]
.
Note:
- The order of the result is not important. So in the above example,
[5, 3]
is also correct. - Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
Difficulty:Medium
class Solution(object): def singleNumber(self, nums): """ :type nums: List[int] :rtype: List[int] """ ans = [] i = 0 leng = len(nums) nums.sort() while i<leng: if i+1>=leng: ans.append(nums[i]) return ans elif nums[i]!=nums[i+1]: ans.append(nums[i]) i+=1 else: i+=2 return ans
0 0
- leetCode #260 Single Number III
- LeetCode(260)Single Number III
- [leetcode 260]Single Number III
- Leetcode #260 Single Number III
- [LeetCode 260] Single Number III
- leetcode: (260) Single Number III
- leetcode 260 : Single Number III
- LeetCode 260 Single Number III
- 【LEETCODE】260-Single Number III
- [leetcode 260] Single Number III
- LeetCode 260:Single Number III
- LeetCode #260 Single Number III
- LeetCode 260 Single Number III
- 【LeetCode-260】Single Number III
- LeetCode[260]Single Number III
- Leetcode 260 - Single Number III
- LeetCode-260:Single Number III
- LeetCode[260] Single Number III
- 做葡萄酒全过程
- Linux/ubuntu 截图工具的使用
- 【leetcode每日一题】24.Swap Nodes in Pairs
- 本人是一名专科学生,现自学java,记录学习。希望能够大家多多提提意见
- 伪分布式hadoop环境搭建
- Leetcode #260 Single Number III
- 黑马程序员---------Java基础------------多线程简单总结
- T-SQL 公用表表达式(CTE)
- Calendar实现得到指定月的第一天和最后一天
- 多态
- 错误纪录1
- 文件上传下载
- PowerDesigner——配置模板(一)
- 那些NB的开源框架