LeetCode OJ 系列之287 Find the Duplicate Number --Python

最新推荐文章于 2018-11-30 20:22:09 发布

原创最新推荐文章于 2018-11-30 20:22:09 发布 · 445 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Python #OJ #LeetCode

Python 同时被 2 个专栏收录

26 篇文章

订阅专栏

LeetCode

22 篇文章

订阅专栏

本文介绍了一种在常数空间复杂度下，通过排序数组并遍历查找重复元素的方法，适用于仅包含1到n整数的数组，确保唯一性和效率。

Problem:

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.

Note:

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

Answer:

class Solution(object):
    def findDuplicate(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums.sort()
        for i in range(len(nums)):
            if i+1 > nums[i]:
                return nums[i]
        return 0