[Leetcode] 287. Find the Duplicate Number (二分法)

287. Find the Duplicate Number (题目链接)

Medium

Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.

Example 1:

Input: [1,3,4,2,2]
Output: 2

Example 2:

Input: [3,1,3,4,2]
Output: 3

Note:

1. You must not modify the array (assume the array is read only).
2. You must use only constant, O(1) extra space.
3. Your runtime complexity should be less than O(n2).
4. There is only one duplicate number in the array, but it could be repeated more than once.

 

方法1：二分法 O(n log n)

m = (l + l) // 2

cnt为小于等于m的个数，l = m + 1，否则 r = m

class Solution:
    def findDuplicate(self, nums: List[int]) -> int:
        nums.sort()
        l, r = 1, len(nums) - 1
        while l < r:
            m = (l + r) // 2
            cnt = 0
            for num in nums:
                if num <= m:
                    cnt += 1
            if cnt <= m:
                l = m + 1
            else:
                r = m

        return l

 

方法2：快慢指针

class Solution:
    def findDuplicate(self, nums: List[int]) -> int:
        slow, fast = nums[0], nums[nums[0]]
        while True:
            slow = nums[slow]
            fast = nums[nums[fast]]
            if slow == fast:
                break
        fast = 0
        while True:
            slow = nums[slow]
            fast = nums[fast]
            if slow == fast:
                return slow