442. Find All Duplicates in an Array(LeetCode)
Posted 无惧风云
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了442. Find All Duplicates in an Array(LeetCode)相关的知识,希望对你有一定的参考价值。
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]
1 class Solution { 2 public: 3 vector<int> findDuplicates(vector<int>& nums) { 4 vector<int> res; 5 for (int i = 0; i < nums.size(); i++){ 6 nums[abs(nums[i]) - 1] = -nums[abs(nums[i]) - 1]; 7 if (nums[abs(nums[i]) - 1] > 0) res.push_back(abs(nums[i])); 8 } 9 return res; 10 } 11 };
以上是关于442. Find All Duplicates in an Array(LeetCode)的主要内容,如果未能解决你的问题,请参考以下文章
442. Find All Duplicates in an Array
442. Find All Duplicates in an Array
442. Find All Duplicates in an Array
442. Find All Duplicates in an Array