Commit 9ff99f4

committed

feat: add go solution to leetcode problem: No.0026

1 parent fae4fbc commit 9ff99f4Copy full SHA for 9ff99f4

File tree

+45

-20

lines changed

+45

-20

lines changed

Lines changed: 17 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -105,6 +105,23 @@ var removeDuplicates = function (nums) {`
`105`	`105`	`};`
`106`	`106`	```
`107`	`107`
	`108`	`+### Go`
	`109`	`+`
	`110`	+```go
	`111`	`+func removeDuplicates(nums []int) int {`
	`112`	`+ cnt := 0`
	`113`	`+ n := len(nums)`
	`114`	`+ for i := 1; i < n; i++ {`
	`115`	`+ if nums[i] == nums[i - 1] {`
	`116`	`+ cnt++`
	`117`	`+ } else {`
	`118`	`+ nums[i - cnt] = nums[i]`
	`119`	`+ }`
	`120`	`+ }`
	`121`	`+ return n - cnt`
	`122`	`+}`
	`123`	+```
	`124`	`+`
`108`	`125`	`### ...`
`109`	`126`
`110`	`127`	```

Lines changed: 17 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -115,6 +115,23 @@ var removeDuplicates = function (nums) {`
`115`	`115`	`};`
`116`	`116`	```
`117`	`117`
	`118`	`+### Go`
	`119`	`+`
	`120`	+```go
	`121`	`+func removeDuplicates(nums []int) int {`
	`122`	`+ cnt := 0`
	`123`	`+ n := len(nums)`
	`124`	`+ for i := 1; i < n; i++ {`
	`125`	`+ if nums[i] == nums[i - 1] {`
	`126`	`+ cnt++`
	`127`	`+ } else {`
	`128`	`+ nums[i - cnt] = nums[i]`
	`129`	`+ }`
	`130`	`+ }`
	`131`	`+ return n - cnt`
	`132`	`+}`
	`133`	+```
	`134`	`+`
`118`	`135`	`### ...`
`119`	`136`
`120`	`137`	```

Lines changed: 11 additions & 20 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,21 +1,12 @@`
`1`		`-/**`
`2`		`- * @lc app=leetcode.cn id=26 lang=golang`
`3`		`- * Accepted`
`4`		`- * 161/161 cases passed (144 ms)`
`5`		`- * Your runtime beats 36.91 % of golang submissions`
`6`		`- * Your memory usage beats 40.4 % of golang submissions (8.2 MB)`
`7`		`- */`
`8`		`-`
`9`	`1`	`func removeDuplicates(nums []int) int {`
`10`		`- if nums == nil \|\| len(nums) == 0 {`
`11`		`- return 0`
`12`		`- }`
`13`		`- j := 0`
`14`		`- for i := 1; i < len(nums); i++ {`
`15`		`- if nums[j] != nums[i] {`
`16`		`- j++`
`17`		`- nums[j] = nums[i]`
`18`		`- }`
`19`		`- }`
`20`		`- return j + 1`
`21`		`-}`
	`2`	`+ cnt := 0`
	`3`	`+ n := len(nums)`
	`4`	`+ for i := 1; i < n; i++ {`
	`5`	`+ if nums[i] == nums[i - 1] {`
	`6`	`+ cnt++`
	`7`	`+ } else {`
	`8`	`+ nums[i - cnt] = nums[i]`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+ return n - cnt`
	`12`	`+}`

Comments

(0)