原题:
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
Example:
Input:
[4,3,2,7,8,2,3,1]
Output:
[5,6]
题意:
给一组 1 ≤ a[i] ≤ n的整数(其中n等于数组的长度),有一些元素出现了两次,其他的出现了一次。找出所有在[1, n]中消失的元素。假设返回的链表不算额外空间的话,你可以做到不需要任何空间并且时间复杂度为O(n)吗?
思路:
1.新建链表list;
2.遍历元素,将元素本该放置的位置上置为相反数,这样正确放置元素的位置上就都是负数了,剩下没有正确放置位置即为所求位置;
3.将所求位置+1即为所求元素,将他们添加到list即可。
代码:
public class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
List<Integer> list = new ArrayList<Integer>();
//遍历数组,将数组上本该放置该元素的位置上置反
for(int i = 0;i < nums.length;i++){
int value = Math.abs(nums[i]) - 1;
if(nums[value] > 0){
nums[value] = -nums[value];
}
}
//检查位置上为被置反的元素,将其添加到list中
for(int i = 0;i < nums.length;i++){
if(nums[i] > 0){
list.add(i + 1);
}
}
return list;
}
}