Commit ee27089

committed

🐱(array): 80. 删除排序数组中的重复项 II

补充解法

1 parent 320e6d3 commit ee27089Copy full SHA for ee27089

File tree

+22

-1

lines changed

+22

-1

lines changed

Lines changed: 22 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1015,6 +1015,7 @@ class Solution(object):`
`1015`	`1015`	- 此时要删除 `nums[i + 2]` 就要向后找到一个 `nums[j]`(满足 `nums[j] != nums[i]`)替换 `nums[i + 2]`
`1016`	`1016`
`1017`	`1017`	```python
	`1018`	`+# 这个好理解一些`
`1018`	`1019`	`class Solution(object):`
`1019`	`1020`	`def removeDuplicates(self, nums):`
`1020`	`1021`	`"""`
`@@ -1032,7 +1033,27 @@ class Solution(object):`
`1032`	`1033`	`nums[i + 2] = nums[j]`
`1033`	`1034`	`i = i + 1`
`1034`	`1035`
`1035`		`- return i+2`
	`1036`	`+ return i + 2`
	`1037`	+```
	`1038`	`+`
	`1039`	`+补充解法:`
	`1040`	`+`
	`1041`	+```python
	`1042`	`+class Solution:`
	`1043`	`+ def removeDuplicates(self, nums: List[int]) -> int:`
	`1044`	`+ i, count = 1, 1`
	`1045`	`+ for j in range(1, len(nums)):`
	`1046`	`+ if nums[j] == nums[j - 1]:`
	`1047`	`+ count += 1`
	`1048`	`+ else:`
	`1049`	`+ count = 1`
	`1050`	`+`
	`1051`	`+ if count <= 2:`
	`1052`	`+ # 相同的数 <= 2,跳过 i`
	`1053`	`+ nums[i] = nums[j]`
	`1054`	`+ i += 1`
	`1055`	`+`
	`1056`	`+ return i`
`1036`	`1057`	```
`1037`	`1058`
`1038`	`1059`

Comments

(0)