问题:
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]
解析:
方法1:根据题目要求:给的验证数组最多出现两次相同的数,或者出现一次某个数,要求不开辟空间,时间复杂度是O(n).因为数组输入的特点 1<=sums[i]<=n,则可以把原数组当hash表用 ,因为原数组是正数,标为负数表示出现过,如果遇到负数 就表示第二次出现,就可以找出所有出现过2次的数
public class Solution { public List<Integer> findDuplicates(int[] nums) { int length = nums.length; List<Integer> list = new ArrayList<Integer>(); for (int i = 0; i < length; i++) { int val = Math.abs(nums[i]) - 1; if (nums[val] > 0) { nums[val] = -nums[val]; }else { list.add(Math.abs(nums[i])); } } return list; } }
方法2:如果开辟一个内存空间大的话,重新定义一个数组,赋值为0,然后把原数组中的数跟新的数组的索引对应 ,每次+1;
public class Solution {
public List<Integer> findDuplicates(int[] nums) {
int length = nums.length; List<Integer> list = new ArrayList<Integer>(); if (length == 0) { return list; } else { int count[] = new int[length]; Arrays.fill(count, 0); for (int i = 0; i < length; i++) { count[nums[i] - 1]++; } for (int j = 0; j < length; j++) { if (count[j] == 2) { list.add(j + 1); } } return list;
}
}