开始同步练习LeetCode啦!
从Array开始入手:
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]
class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
List<Integer> list = new ArrayList<Integer>();
int temp;
for(int i = 0; i < nums.length; i++){
while(nums[i]-1 != i){
if(nums[nums[i]-1] == nums[i]) {
break;
}
else{
temp = nums[nums[i]-1];
nums[nums[i]-1] = nums[i];
nums[i] = temp;
}
}
}
for(int i = 0; i < nums.length; i++){
if(nums[i] != i+1) list.add(i+1);
}
return list;
}
}
不确定是否能达到O(n)的复杂度。。。不过提交成功了。。。