Given an array containing n distinct numbers taken from 0, 1, 2, ..., n
, find the one that is missing from the array.
For example,
Given nums = [0, 1, 3]
return 2
.
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
2. 新建一个差不多 一样的数组,也不行。space 复杂度O(1)
3. 只能在原数组上做更改。但需要检验的地方比较多。代码写的太难看,请见谅。
public class Solution {
public int missingNumber(int[] nums) {int sign = -1*(nums.length + 1);
if(nums.length == 0)
return 0;
if(nums.length == 1){
if (nums[0] == 0)
return 1;
else
return 0;
}
for(int i = 0; i < nums.length; i++){
int index = nums[i];
if (index < 0){
if (index == sign)
index = 0;
else
index = index*(-1);
}
if(index < nums.length){
if (nums[index] > 0)
nums[index] = -1*nums[index];
else if (nums[index] == 0)
nums[index] = sign;
}
}
for(int j = 0; j < nums.length; j++)
{
if (nums[j] >= 0)
return j;
}
return nums.length;
}
}