Package g0201_0300.s0287_find_the_duplicate_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    287 - Find the Duplicate Number\.

    Medium

    Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive.

    There is only one repeated number in nums, return this repeated number.

    You must solve the problem without modifying the array nums and uses only constant extra space.

    Example 1:

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

    Output: 2

    Example 2:

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

    Output: 3

    Constraints:

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

    • nums.length == n + 1

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

    • All the integers in nums appear only once except for precisely one integer which appears two or more times.

    Follow up:

    • How can we prove that at least one duplicate number must exist in nums?

    • Can you solve the problem in linear 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 findDuplicate(IntArray nums)

      • Methods inherited from class java.lang.Object

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