268. Missing Number
Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
Example 1:
Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.
Example 2:
Input: nums = [0,1]
Output: 2
Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.
Example 3:
Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8
Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.
Constraints:
- n == nums.length
- 1 < = n < = 1 0 4 1 <= n <= 10^4 1<=n<=104
- 0 <= nums[i] <= n
- All the numbers of nums are unique.
From: LeetCode
Link: 268. Missing Number
Solution:
Ideas:
1. Calculate the Total Sum:
- Use the formula for the sum of the first n natural numbers: totalSum= n × ( n + 1 ) 2 \frac{n\times(n+1)}{2} 2n×(n+1).
- This gives the expected sum of numbers from 0 to n.
2. Calculate the Array Sum:
- Sum up all the elements in the given array.
3. Find the Missing Number:
- Subtract the sum of the array elements from the total sum. The result will be the missing number.
Code:
int missingNumber(int* nums, int numsSize) {
int totalSum = numsSize * (numsSize + 1) / 2;
int arraySum = 0;
for (int i = 0; i < numsSize; i++) {
arraySum += nums[i];
}
return totalSum - arraySum;
}