Leetcode 268: Missing Number

Posted 2020-10-16 Keep walking

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

Example 1

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

 

Example 2

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

 1 public class Solution {
 2     public int MissingNumber(int[] nums) {
 3         int n = nums.Length;
 4         
 5         for (int i = 0; i < nums.Length; i++)
 6         {
 7             n ^= i ^ nums[i];
 8         }
 9         
10         return n;
11     }
12 }