【LeetCode】442. Find All Duplicates in an Array【M】【60】
来源:互联网 发布:知乎 德国国防军 编辑:程序博客网 时间:2024/06/07 06:31
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements that appear twice in this array.
Could you do it without extra space and in O(n) runtime?
Example:
Input:[4,3,2,7,8,2,3,1]Output:[2,3]
Subscribe to see which companies asked this question.
主要就是不用额外的空间 以及O(n)。
所以就用数组内部数值进行标记,每次访问,把数值对应的index对应的数标记为负数,要是第二次遇见负数,那就说明出现两次了
class Solution(object): def findDuplicates(self, nums): res = [] for i in xrange(len(nums)): idx = abs(nums[i]) - 1 if nums[idx] < 0: res += idx+1, nums[idx] = -abs(nums[idx]) #print idx,nums,res return res
0 0
- 【LeetCode】442. Find All Duplicates in an Array【M】【60】
- 442. Find All Duplicates in an Array (M)
- [LeetCode]Find All Duplicates in an Array
- LeetCode Find All Duplicates in an Array
- Leetcode Find All Duplicates in an Array
- [Leetcode] Find All Duplicates in an Array
- leetCode-Find All Duplicates in an Array
- [leetcode] 442. Find All Duplicates in an Array
- LeetCode 442. Find All Duplicates in an Array
- leetcode:442. Find All Duplicates in an Array
- 442. Find All Duplicates in an Array(LeetCode)
- <leetcode>442. Find All Duplicates in an Array
- [leetcode]442. Find All Duplicates in an Array(java)
- [LeetCode]442. Find All Duplicates in an Array
- Leetcode 442. Find All Duplicates in an Array
- LeetCode笔记:442. Find All Duplicates in an Array
- 【LeetCode】 442. Find All Duplicates in an Array
- [leetcode]442. Find All Duplicates in an Array
- ACID vs BASE
- jdbc连接数据库的优化和防止注入
- SVN 使用方法。
- Android中关于文件的操作
- 《网络游戏核心技术与实战》读书笔记
- 【LeetCode】442. Find All Duplicates in an Array【M】【60】
- 每天一个 Linux 命令(36):diff 命令
- WEB-INF是Java的WEB应用的安全目录。所谓安全就是客户端无法访问,只有服务端可以访问的目录。
- 自己所做的一个轮播图案例,以供参考,欢迎指教
- Android 四大大图片缓存(Imageloader,Picasso,Glide,Fresco)原理.
- Oracle Instant Client(即时客户端) 安装与配置
- 实现自己的printf函数
- iOS App上架流程(2016详细版)
- DelayQueue原理分析