LeetCode
来源:互联网 发布:怎么在淘宝进货 编辑:程序博客网 时间:2024/06/06 03:47
Q:
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
Example:
Input:[4,3,2,7,8,2,3,1]Output:[5,6]
A:
class Solution(object): def findDisappearedNumbers(self, nums): """ :type nums: List[int] :rtype: List[int] """ return list(set(range(1, len(nums)+1)) - set(nums))
将两集合相减,求得其中差异数字,再列表化。
阅读全文
0 0
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- leetcode
- 【字符串】HDU1088Write a simple HTML Browser
- const 的用法
- 笔记
- 【NOIP2017提高A组模拟9.5】遥远的金字塔 斜率优化详解
- 员工部门表综合查询60题
- LeetCode
- Hive实现累计报表查询
- JAVA-XML(读(解析)写xml文件)
- 51nod 1050 循环数组最大子段和
- 阿里数据竞赛总结
- MyBatis关系映射
- HEALTH
- oracle一些杂乱的基础东西!
- 垃圾收集