LeetCode 442. Find All Duplicates in an Array (Medium)

最新推荐文章于 2020-07-07 20:18:24 发布

Boston_Kimisong

最新推荐文章于 2020-07-07 20:18:24 发布

阅读量107

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_45744426/article/details/103750762

版权

LeetCode 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

Description:

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]

Analysis:

Traverse the array, and in each iteration, we multiply nums[abs(nums[i])-1] by -1. After each multiplication, we check the value of nums[abs(nums[i])-1], if the value is above 0, it means that abs(nums[i]) occurs twice otherwise it only occurs once.

Code:

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