We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 1e5ece4 commit ce09352Copy full SHA for ce09352
lcof/面试题03. 数组中重复的数字/Solution.py
@@ -5,3 +5,5 @@ def findRepeatNumber(self, nums: List[int]) -> int:
5
if num == nums[num]:
6
return num
7
nums[i], nums[num] = nums[num], nums[i]
8
+ num = nums[i]
9
+ return -1
0 commit comments