Commit cb76a9f

author

Shuo

authored

Merge pull request #696 from openset/develop

Add: Kth Largest Element in an Array

2 parents 6646a41 + c49465b commit cb76a9fCopy full SHA for cb76a9f

File tree

+41

-2

lines changed

+41

-2

lines changed

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -49,6 +49,7 @@ var problemStatus = map[int]bool{`
`49`	`49`	`101: true,`
`50`	`50`	`104: true,`
`51`	`51`	`108: true,`
	`52`	`+ 110: true,`
`52`	`53`	`118: true,`
`53`	`54`	`119: true,`
`54`	`55`	`121: true,`
`@@ -79,6 +80,7 @@ var problemStatus = map[int]bool{`
`79`	`80`	`202: true,`
`80`	`81`	`204: true,`
`81`	`82`	`206: true,`
	`83`	`+ 215: true,`
`82`	`84`	`217: true,`
`83`	`85`	`219: true,`
`84`	`86`	`231: true,`
`@@ -89,6 +91,7 @@ var problemStatus = map[int]bool{`
`89`	`91`	`258: true,`
`90`	`92`	`268: true,`
`91`	`93`	`283: true,`
	`94`	`+ 290: true,`
`92`	`95`	`303: true,`
`93`	`96`	`326: true,`
`94`	`97`	`342: true,`
`@@ -217,4 +220,5 @@ var problemStatus = map[int]bool{`
`217`	`220`	`1154: true,`
`218`	`221`	`1163: true,`
`219`	`222`	`1185: true,`
	`223`	`+ 1221: true,`
`220`	`224`	`}`

Lines changed: 8 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1 +1,8 @@`
`1`		`-package kth_largest_element_in_an_array`
	`1`	`+package problem_215`
	`2`	`+`
	`3`	`+import "sort"`
	`4`	`+`
	`5`	`+func findKthLargest(nums []int, k int) int {`
	`6`	`+ sort.Ints(nums)`
	`7`	`+ return nums[len(nums)-k]`
	`8`	`+}`

Lines changed: 29 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1 +1,29 @@`
`1`		`-package kth_largest_element_in_an_array`
	`1`	`+package problem_215`
	`2`	`+`
	`3`	`+import "testing"`
	`4`	`+`
	`5`	`+type caseType struct {`
	`6`	`+ input []int`
	`7`	`+ k int`
	`8`	`+ expected int`
	`9`	`+}`
	`10`	`+`
	`11`	`+func TestFindKthLargest(t *testing.T) {`
	`12`	`+ tests := [...]caseType{`
	`13`	`+ {`
	`14`	`+ input: []int{3, 2, 1, 5, 6, 4},`
	`15`	`+ k: 2,`
	`16`	`+ expected: 5,`
	`17`	`+ }, {`
	`18`	`+ input: []int{3, 2, 3, 1, 2, 4, 5, 5, 6},`
	`19`	`+ k: 4,`
	`20`	`+ expected: 4,`
	`21`	`+ },`
	`22`	`+ }`
	`23`	`+ for _, tc := range tests {`
	`24`	`+ output := findKthLargest(tc.input, tc.k)`
	`25`	`+ if output != tc.expected {`
	`26`	`+ t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)`
	`27`	`+ }`
	`28`	`+ }`
	`29`	`+}`

Comments

(0)