LeetCode - 442. Find All Duplicates in an Array
Posted 码上哈希
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode - 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]
正负标记,不影响原先值。
public class Solution { public List<Integer> findDuplicates(int[] nums) { List<Integer> arr = new ArrayList<Integer>(); if (nums == null) return arr; for (int i=0; i<nums.length; i++) { int index = abs(nums[i]) - 1; if (nums[index] < 0) arr.add(abs(nums[i])); else nums[index] = -nums[index]; } return arr; } private int abs(int a) { return a>0?a:-a; } }
以上是关于LeetCode - 442. Find All Duplicates in an Array的主要内容,如果未能解决你的问题,请参考以下文章
442. Find All Duplicates in an Array(LeetCode)
LeetCode - 442. Find All Duplicates in an Array
442. Find All Duplicates in an Array - LeetCode
LeetCode解题思路:442. Find All Duplicates in an Array
LeetCode 442. Find All Duplicates in an Array
LeetCode 448. Find All Numbers Disappeared in an Array & 442. Find All Duplicates in an Array(示例