Package g0601_0700.s0645_set_mismatch

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    645 - Set Mismatch\.

    Easy

    You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got duplicated to another number in the set, which results in repetition of one number and loss of another number.

    You are given an integer array nums representing the data status of this set after the error.

    Find the number that occurs twice and the number that is missing and return them in the form of an array.

    Example 1:

    Input: nums = 1,2,2,4

    Output: 2,3

    Example 2:

    Input: nums = 1,1

    Output: 1,2

    Constraints:

    • <code>2 <= nums.length <= 10<sup>4</sup></code>

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

    • 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 IntArray findErrorNums(IntArray nums)

      • Methods inherited from class java.lang.Object

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