LeetCode 448. Find All Numbers Disappeared in an Array
来源:互联网 发布:银科环企软件 编辑:程序博客网 时间:2024/05/17 21:44
Problem Statement
(Source) 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]
Solution
class Solution(object): def findDisappearedNumbers(self, nums): """ :type nums: List[int] :rtype: List[int] """ for i in xrange(len(nums)): while nums[i] != i + 1: correct_pos = nums[i] - 1 if nums[correct_pos] == correct_pos + 1: break nums[i], nums[correct_pos] = nums[correct_pos], nums[i] return [i + 1 for i in xrange(len(nums)) if nums[i] != i + 1]
0 0
- LeetCode-Array-448. Find All Numbers Disappeared in an Array
- leetcode:448. Find All Numbers Disappeared in an Array
- LeetCode 448. Find All Numbers Disappeared in an Array
- <leetcode>448.Find All Numbers Disappeared in an Array
- [LeetCode] 448. Find All Numbers Disappeared in an Array
- [LeetCode]448. Find All Numbers Disappeared in an Array
- leetcode 448. Find All Numbers Disappeared in an Array
- Leetcode 448. Find All Numbers Disappeared in an Array
- 【LeetCode】 448. Find All Numbers Disappeared in an Array
- 448. [LeetCode]Find All Numbers Disappeared in an Array
- [leetcode] 448. Find All Numbers Disappeared in an Array
- LeetCode 448. Find All Numbers Disappeared in an Array
- Leetcode-448. Find All Numbers Disappeared in an Array
- 【Leetcode】448. Find All Numbers Disappeared in an Array
- LeetCode - 448. Find All Numbers Disappeared in an Array
- LeetCode 448. Find All Numbers Disappeared in an Array
- LeetCode--448. Find All Numbers Disappeared in an Array
- LeetCode 448. Find All Numbers Disappeared in an Array(Java)
- Linux编程VIM编辑器的命令模式
- android去掉滑动到顶部和底部的阴影
- coredata学习总结(十四)
- MySQL自定义函数
- 实用的正则
- LeetCode 448. Find All Numbers Disappeared in an Array
- 霍夫曼树简介
- LVM逻辑卷管理器配置小结
- hdu 1548 简单BFS
- poj1458 Common Subsequence 动态规划
- struts2 分文件编写框架配置文件
- mysql中列的操作
- 1796 社交网络[最短路条数]
- 虚拟机装中linux linux服务器环境变量修改