zoukankan      html  css  js  c++  java
  • [LC] 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]

    class Solution {
        public List<Integer> findDuplicates(int[] nums) {
            List<Integer> res = new ArrayList<>();
            if (nums == null || nums.length == 0) {
                return res;
            }
            for (int i = 0; i< nums.length; i++) {
                // map nums[i] to index
                int index = Math.abs(nums[i]) - 1;
                if (nums[index] < 0) {
                    res.add(index + 1);
                }
                nums[index] = -nums[index];
            }
            return res;
        }
    }
  • 相关阅读:
    P、NP、NPC、NPH问题介绍
    过河卒 bfs搜索
    对迪杰斯特拉算法的理解
    第七周
    周作业
    月考一
    第四周
    第三周
    第二周作业
    46期第一次作业
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12066674.html
Copyright © 2011-2022 走看看