首页 > 代码库 > [leetcode-442-Find All Duplicates in an Array]
[leetcode-442-Find All Duplicates in an Array]
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]
思路:
The concept here is to negate each number‘s index as the input is 1 <= a[i] <= n (n = size of array).
Once a value is negated, if it requires to be negated again then it is a duplicate.
vector<int> findDuplicates(vector<int>& nums) { vector<int>ret; for (int i = 0; i < nums.size();i++) { int index = abs(nums[i]) - 1; if (nums[index] > 0) { nums[index] = - nums[index]; } else { ret.push_back(abs(nums[i])); } } return ret; }
参考:
https://discuss.leetcode.com/topic/64805/java-easy-to-understand-solution-without-extra-space-and-in-o-n-time
[leetcode-442-Find All Duplicates in an Array]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。