【LeetCode】442.Find All Duplicates in an Array解题报告
题目地址:https://leetcode.com/problems/find-all-duplicates-in-an-array/#/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?
Examples:
Input:
[4,3,2,7,8,2,3,1]
Output:
[2,3]
Solutions:
自己的解,但是用到了额外的空间,意外的a了,但是结果超越了百分之4.2的程序哈哈哈哈
public class Solution {
public List<Integer> findDuplicates(int[] nums) {
Map<Integer,Integer> map=new HashMap<Integer,Integer>();
List<Integer> list=new ArrayList<Integer>();
for(int i=0;i<nums.length;i++){
if(map.containsKey(nums[i])){
list.add(nums[i]);
}else{
map.put(nums[i],1);
}
}
return list;
}
}
正解:
//time:O(n)
//space:O(1)
public class Solution {
public 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;
}
}
思想就是说从数组nums第一个数开始,从前往后看是否map中存在值为target-nums[i]的数,不存在则将有前到后所有值写入map,直到找到和为target的两个数中的后一个数为止。
Date:2018年2月11日