Commit7a71b7a

committed

add 374 solution

1 parentf260fcb commit7a71b7aCopy full SHA for 7a71b7a

File tree

+31

-10

lines changed

+31

-10

lines changed

Lines changed: 23 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,26 @@`
`1`	`1`	`package Solution`
`2`	`2`
`3`		`-funcSolution(xbool)bool {`
`4`		`-returnx`
	`3`	`+import"sort"`
	`4`	`+`
	`5`	`+functopKFrequent(nums []int,kint) []int {`
	`6`	`+tmp:=make(map[int]int)`
	`7`	`+res:= []int{}`
	`8`	`+s:= [][]int{}`
	`9`	`+//统计每个字符出现次数`
	`10`	`+for_,v:=rangenums {`
	`11`	`+tmp[v]++`
	`12`	`+}`
	`13`	`+//保存数字/次数映射 i,v 数字，次数`
	`14`	`+fori,v:=rangetmp {`
	`15`	`+s=append(s, []int{i,v})`
	`16`	`+}`
	`17`	`+//按照次数排序`
	`18`	`+sort.Slice(s,func(a,bint)bool {`
	`19`	`+returns[a][1]>s[b][1]`
	`20`	`+})`
	`21`	`+//截取前k个`
	`22`	`+fori:=0;i<k;i++ {`
	`23`	`+res=append(res,s[i][0])`
	`24`	`+}`
	`25`	`+returnres`
`5`	`26`	`}`

Lines changed: 8 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,21 +10,21 @@ func TestSolution(t *testing.T) {`
`10`	`10`	`//测试用例`
`11`	`11`	`cases:= []struct {`
`12`	`12`	`namestring`
`13`		`-inputsbool`
`14`		`-expectbool`
	`13`	`+input1 []int`
	`14`	`+input2int`
	`15`	`+expect []int`
`15`	`16`	`}{`
`16`		`-{"TestCase",true,true},`
`17`		`-{"TestCase",true,true},`
`18`		`-{"TestCase",false,false},`
	`17`	`+{"TestCase", []int{1,1,1,2,2,3},2, []int{1,2}},`
	`18`	`+{"TestCase", []int{1},1, []int{1}},`
`19`	`19`	`}`
`20`	`20`
`21`	`21`	`//开始测试`
`22`	`22`	`fori,c:=rangecases {`
`23`	`23`	`t.Run(c.name+" "+strconv.Itoa(i),func(t*testing.T) {`
`24`		`-got:=Solution(c.inputs)`
	`24`	`+got:=topKFrequent(c.input1,c.input2)`
`25`	`25`	`if!reflect.DeepEqual(got,c.expect) {`
`26`		`-t.Fatalf("expected: %v, but got: %v, withinputs: %v",`
`27`		`-c.expect,got,c.inputs)`
	`26`	`+t.Fatalf("expected: %v, but got: %v, withinput1: %v input2: %v",`
	`27`	`+c.expect,got,c.input1,c.input2)`
`28`	`28`	`}`
`29`	`29`	`})`
`30`	`30`	`}`

Comments

(0)