public class Solution {
public int missingNumber(int[] nums) {
int[] copy = new int[nums.length+1];
copy[0] = 1;
for (int i = 0; i < nums.length; i++) {
copy[nums[i]] = nums[i];
}
for (int i = 1; i < copy.length; i++) {
if (copy[i]==0) {
return i;
}
}
return 0;
}
}
解法二:
public class Solution {
public int missingNumber(int[] nums) {
int sum = (nums.length+1)*nums.length/2;
int sumNum=0;
for (int i = 0; i < nums.length; i++) {
sumNum+=nums[i];
}
return sum - sumNum;
}
}