268. Missing Number Easy

1/**
2 * [268] Missing Number
3 *
4 * 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.
5 *  
6 * Example 1:
7 * 
8 * Input: nums = [3,0,1]
9 * Output: 2
10 * 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.
11 * 
12 * Example 2:
13 * 
14 * Input: nums = [0,1]
15 * Output: 2
16 * 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.
17 * 
18 * Example 3:
19 * 
20 * Input: nums = [9,6,4,2,3,5,7,0,1]
21 * Output: 8
22 * 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.
23 * 
24 *  
25 * Constraints:
26 * 
27 * 	n == nums.length
28 * 	1 <= n <= 10^4
29 * 	0 <= nums[i] <= n
30 * 	All the numbers of nums are unique.
31 * 
32 *  
33 * Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?
34 * 
35 */
36pub struct Solution {}
37
38// problem: https://leetcode.com/problems/missing-number/
39// discuss: https://leetcode.com/problems/missing-number/discuss/?currentPage=1&orderBy=most_votes&query=
40
41// submission codes start here
42
43impl Solution {
44    pub fn missing_number(nums: Vec<i32>) -> i32 {
45        0
46    }
47}
48
49// submission codes end
50
51#[cfg(test)]
52mod tests {
53    use super::*;
54
55    #[test]
56    fn test_268() {
57    }
58}
59