Package g0401_0500.s0448_find_all_numbers_disappeared_in_an_array

Class Solution

java.lang.Object

g0401_0500.s0448_find_all_numbers_disappeared_in_an_array.Solution

public class Solution
extends Object

448 - Find All Numbers Disappeared in an Array.<p>Easy</p> <p>Given an array <code>nums</code> of <code>n</code> integers where <code>nums[i]</code> is in the range <code>[1, n]</code>, return <em>an array of all the integers in the range</em> <code>[1, n]</code> <em>that do not appear in</em> <code>nums</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [4,3,2,7,8,2,3,1]</p> <p><strong>Output:</strong> [5,6]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,1]</p> <p><strong>Output:</strong> [2]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == nums.length</code></li> <li><code>1 <= n <= 10⁵</code></li> <li><code>1 <= nums[i] <= n</code></li> </ul> <p><strong>Follow up:</strong> Could you do it without extra space and in <code>O(n)</code> runtime? You may assume the returned list does not count as extra space.</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<Integer>	findDisappearedNumbers(int[] nums)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

findDisappearedNumbers

public List<Integer> findDisappearedNumbers(int[] nums)