题目链接:https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/
题解思路:
1. 先排序(不排序则超时)
2. 循环看相邻元素是否有相同的,有直接return
注意:python中,排序函数为sorted,nums = sorted(nums),则nums列表才真正变化
题解代码:
class Solution(object):
def findRepeatNumber(self, nums):
numSize = len(nums)
nums = sorted(nums)
for i in range(numSize):
if(nums[i] == nums[i+1]):
return nums[i]