StarWalker

Where my heart will take me

0%

Leetcode268-missingNumber

Posted on Edited on In Views: Valine:
Solution Report of LeetCode Acceptted

Description

Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.

Example

Example 1:

1
2
Input: [3,0,1]
Output: 2

Example 2:
1
2
Input: [9,6,4,2,3,5,7,0,1]
Output: 8

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
    public int missingNumber(int[] nums) {
        int n = nums.length;
        int sum = (n)*(n+1)/2;
        int sum2 = 0;
        for (int it: nums) sum2+=it;
        return sum - sum2;
        
        // // Method 2: XOR
        // int res = 0, i;
        // for (i = 0; i< nums.length;i++){
        //     res = res ^ i ^ nums[i];
        // }
        // return res ^ i;
    }
}