LeetCode. Missing Number [Bit]

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

 

Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

 

-Summary-

1. Bit operation on length of the nums list and each index and value of the nums list.

2. return with an answer.

 

Leetcode Solution Explanation

 

Time Complexity: O(n)

Space Complexity: O(1)

 

모든 문제에 대한 저작권은 LeetCode 회사에 있습니다. [Copyright © 2020 LeetCode]