Leetcode_Array_Find All Numbers Disappeared in an Array
来源:互联网 发布:windows 更改用户账户 编辑:程序博客网 时间:2024/06/03 18:32
Tag: Array
Difficulty: Easy
Description:
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]
Code:
class Solution(object): def findDisappearedNumbers(self, nums): """ :type nums: List[int] :rtype: List[int] """ ret=[0 for i in range(len(nums))] for n in nums: ret[n - 1] = n return [i+1 for i,n in enumerate(ret) if n==0]
0 0
- Leetcode_Array_Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- leetcode_Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- leetcode 448Find All Numbers Disappeared in an Array (array)
- LeetCode-Array-448. Find All Numbers Disappeared in an Array
- LeetCode OJ|Array|Find All Numbers Disappeared in an Array
- LeetCode OJ|Array| Find All Numbers Disappeared in an Array
- Hibernate第四天
- 3-4 read/write,lseek函数,cp指令的代码实现
- 聊聊网络游戏同步那点事
- PAT 1001
- C++动态数字长度获取
- Leetcode_Array_Find All Numbers Disappeared in an Array
- Win64 驱动内核编程-1.环境搭建
- 手机号,邮箱 身份证号验证
- Hibernate第三天
- [星文计划]Hybrid Code Networks
- 入门训练
- 【小白の日常】Python安装Numpy包
- POJ1703 Find Them,Catch Them 种类并查集
- PAT 1002