algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-08-02 18:37:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #60 from halfrost/code_quality_improvement

Browse Source 
optimization code quality level from A to A+
This commit is contained in:
halfrost
2020-08-27 01:07:57 +08:00
committed by YDZ
parent 7b7307761c 96c36de45b
commit 46faa66642
543 changed files with 2463 additions and 2412 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md
View File

@ -71,9 +71,9 @@ func removeDuplicates80(nums []int) int {
if len(nums) == 0 {
return 0
}
last, finder, startFinder := 0, 0, -1
last, finder := 0, 0
for last < len(nums)-1 {
startFinder = -1
startFinder := -1
for nums[finder] == nums[last] {
if startFinder == -1 || startFinder > finder {
startFinder = finder
@ -101,4 +101,5 @@ func removeDuplicates80(nums []int) int {
return last + 1
}
```