Package g0401_0500.s0448_find_all_numbers_disappeared_in_an_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    448 - Find All Numbers Disappeared in an Array\.

    Easy

    Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.

    Example 1:

    Input: nums = 4,3,2,7,8,2,3,1

    Output: 5,6

    Example 2:

    Input: nums = 1,1

    Output: 2

    Constraints:

    • n == nums.length

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

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

    Follow up: Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.

    • 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 List<Integer> findDisappearedNumbers(IntArray nums)

      • Methods inherited from class java.lang.Object

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