Package g0201_0300.s0268_missing_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    268 - Missing Number\.

    Easy

    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.

    Example 1:

    Input: nums = 3,0,1

    Output: 2

    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.

    Example 2:

    Input: nums = 0,1

    Output: 2

    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.

    Example 3:

    Input: nums = 9,6,4,2,3,5,7,0,1

    Output: 8

    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.

    Constraints:

    • n == nums.length

    • <code>1 <= n <= 10<sup>4</sup></code>

    • 0 &lt;= nums[i] &lt;= n

    • All the numbers of nums are unique.

    Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer missingNumber(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait