Commit 707f6f8

committed

Create delete-and-earn.go

1 parent 7c7624c commit 707f6f8Copy full SHA for 707f6f8

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+//https://leetcode.com/problems/delete-and-earn/`
	`2`	`+`
	`3`	`+package delete_and_earn`
	`4`	`+`
	`5`	`+import (`
	`6`	`+ "sort"`
	`7`	`+)`
	`8`	`+`
	`9`	`+func deleteAndEarn(nums []int) int {`
	`10`	`+ count := make(map[int]int)`
	`11`	`+ for _, num := range nums {`
	`12`	`+ count[num]++`
	`13`	`+ }`
	`14`	`+ keys := make([]int, 0, len(count))`
	`15`	`+ for k := range count {`
	`16`	`+ keys = append(keys, k)`
	`17`	`+ }`
	`18`	`+ sort.Ints(keys)`
	`19`	`+ dp := make([]int, len(keys))`
	`20`	`+ dp[0] = keys[0] * count[keys[0]]`
	`21`	`+ for i := 1; i < len(keys); i++ {`
	`22`	`+ if keys[i]-keys[i-1] == 1 {`
	`23`	`+ if i > 1 {`
	`24`	`+ dp[i] = max(dp[i-1], dp[i-2]+keys[i]*count[keys[i]])`
	`25`	`+ } else {`
	`26`	`+ dp[i] = max(dp[i-1], keys[i]*count[keys[i]])`
	`27`	`+ }`
	`28`	`+ } else {`
	`29`	`+ dp[i] = dp[i-1] + keys[i]*count[keys[i]]`
	`30`	`+ }`
	`31`	`+ }`
	`32`	`+`
	`33`	`+ return dp[len(dp)-1]`
	`34`	`+}`
	`35`	`+`
	`36`	`+func max(a int, b int) int {`
	`37`	`+ if a > b {`
	`38`	`+ return a`
	`39`	`+ }`
	`40`	`+ return b`
	`41`	`+}`

Comments

(0)