Tcdian / keep

今天不想做,所以才去做。
MIT License
5 stars 1 forks source link

442. Find All Duplicates in an Array #286

Open Tcdian opened 3 years ago

Tcdian commented 3 years ago

442. Find All Duplicates in an Array

给定一个整数数组 a,其中1 ≤ a[i] ≤ n (n为数组长度), 其中有些元素出现 两次 而其他元素出现 一次

找到所有出现 两次 的元素。

你可以不用到任何额外空间并在O(n)时间复杂度内解决这个问题吗?

Example

Input:
[4,3,2,7,8,2,3,1]

Output:
[2,3]
Tcdian commented 3 years ago

Solution

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var findDuplicates = function(nums) {
    const result = [];
    for (let i = 0; i < nums.length; i++) {
        const mapping = Math.abs(nums[i]) - 1;
        if (nums[mapping] < 0) {
            result.push(Math.abs(nums[i]));
        } else {
            nums[mapping] = -nums[mapping];
        }
    }
    return result;
};
function findDuplicates(nums: number[]): number[] {
    const result: number[] = [];
    for (let i = 0; i < nums.length; i++) {
        const mapping = Math.abs(nums[i]) - 1;
        if (nums[mapping] < 0) {
            result.push(Math.abs(nums[i]));
        } else {
            nums[mapping] = -nums[mapping];
        }
    }
    return result;
};