442. Find All Duplicates in an Array

luozhiyun

发布于 2019-09-10 18:44:46

3500

发布于 2019-09-10 18:44:46

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]

我的答案:

    public List<Integer> findDuplicates(int[] nums) {
        sort(nums);
        List<Integer> list = new ArrayList<>();
        for (int i = 1; i < nums.length; i++) {
            if(nums[i] == nums[i-1]){
                list.add(nums[i]);
            }
        }
        return list;
    }

大神答案:

    public static List<Integer> findDuplicates(int[] nums) {
        List<Integer> res = new ArrayList<>();
        for (int i = 0; i < nums.length; ++i) {
            int index = Math.abs(nums[i])-1;
            if (nums[index] < 0)
                res.add(Math.abs(index+1));
            nums[index] = -nums[index];
        }
        return res;
    }

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

原始发表：2018-02-05 ，如有侵权请联系 cloudcommunity@tencent.com 删除

find