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?
Difficulty: Medium
public class Solution {
public int missingNumber(int[] nums) {
int sum = nums.length * (nums.length + 1) / 2;
int curr_sum = 0;
for(int i = 0; i < nums.length; i++){
curr_sum += nums[i];
}
return sum - curr_sum;
}
}