268. Missing Number

JIAKAOBO

LeetCode

感谢赞助!

• ㊗️
• 大家
• offer
• 多多！

Problem

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

Code

class Solution {
    public int missingNumber(int[] nums) {
        int res = nums.length;

        for(int i = 0; i < nums.length; i++) {
            res ^= (i ^ nums[i]);
        }

        return res;
    }
}

class Solution:
    def missingNumber(self, nums: List[int]) -> int:
        res = len(nums)

        for i in range(len(nums)):
            res ^= (i ^ nums[i])

        return res