Commit 7a79dc8

committed

update offer 03

1 parent 19bb098 commit 7a79dc8Copy full SHA for 7a79dc8

File tree

+15

-12

lines changed

+15

-12

lines changed

Lines changed: 1 addition & 2 deletions

Lines changed: 14 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`#==================================================`
`2`		`-#==> Title:`
	`2`	`+#==> Title: 剑指 Offer 03. 数组中重复的数字`
`3`	`3`	`#==> Author: Zhang zhen`
`4`	`4`	`#==> Email: hustmatnoble.gmail.com`
`5`	`5`	`#==> GitHub: https://github.com/MatNoble`
`@@ -10,25 +10,29 @@`
`10`	`10`	`https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/`
`11`	`11`	`"""`
`12`	`12`
	`13`	`+from collections import Counter`
`13`	`14`	`class Solution:`
`14`	`15`	`def findRepeatNumber(self, nums):`
	`16`	`+ # 计数法`
	`17`	`+ # return Counter(nums).most_common(1)[0][0]`
	`18`	`+`
	`19`	`+ # 哈希表`
`15`	`20`	`# dict = set()`
`16`	`21`	`# for num in nums:`
`17`	`22`	`# if num in dict: return num`
`18`	`23`	`# dict.add(num)`
`19`	`24`	`# return -1`
`20`		`- def swap(nums, i, j):`
`21`		`- temp = nums[i]`
`22`		`- nums[i] = nums[j]`
`23`		`- nums[j] = temp`
`24`		`- n = len(nums)`
`25`		`- i = 0`
	`25`	`+`
	`26`	`+ # 原地置换环`
	`27`	`+ i, n = 0, len(nums)`
`26`	`28`	`while i < n:`
`27`		`- if nums[i] == i:`
	`29`	`+ if nums[i] == i:`
`28`	`30`	`i += 1`
`29`	`31`	`continue`
`30`		`- if nums[nums[i]] == nums[i]: return nums[i]`
`31`		`- swap(nums, i, nums[i])`
	`32`	`+ if nums[nums[i]] == nums[i]:`
	`33`	`+ return nums[i] # 环入口`
	`34`	`+ j = nums[i] # 归位`
	`35`	`+ nums[i], nums[j] = nums[j], nums[i]`
`32`	`36`	`return -1`
`33`	`37`
`34`	`38`	`mat = Solution()`