docs: 0703. Kth Largest Element in a Stream

Author: kimi0230

Leetcode/0703.Kth-Largest-Element-in-a-Stream/README.md

@@ -123,7 +123,62 @@ Acceptance Rate
 https://github.com/kimi0230/LeetcodeGolang/blob/master/Leetcode/0703.Kth-Largest-Element-in-a-Stream/main.go
 
 ```go
-
+package kthlargestelementinastream
+
+import (
+	"container/heap"
+	"sort"
+)
+
+/**
+ * Your KthLargest object will be instantiated and called as such:
+ * obj := Constructor(k, nums);
+ * param_1 := obj.Add(val);
+ */
+
+// 時間複雜 O(), 空間複雜 O()
+type KthLargest struct {
+	sort.IntSlice
+	k int
+}
+
+func Constructor(k int, nums []int) KthLargest {
+	kl := KthLargest{k: k}
+	for _, val := range nums {
+		kl.Add(val)
+	}
+	return kl
+}
+
+func (kl *KthLargest) Add(val int) int {
+	heap.Push(kl, val)
+	if kl.Len() > kl.k {
+		heap.Pop(kl)
+	}
+	return kl.IntSlice[0]
+}
+
+func (kl *KthLargest) Push(v interface{}) {
+	kl.IntSlice = append(kl.IntSlice, v.(int))
+}
+
+func (kl *KthLargest) Pop() interface{} {
+	a := kl.IntSlice
+	v := a[len(a)-1]
+	kl.IntSlice = a[:len(a)-1]
+	return v
+}
+
+func KthLargestStream(k int, nums []int, elem []int) []int {
+	obj := Constructor(k, nums)
+	result := []int{0}
+	for _, val := range elem {
+		obj.Add(val)
+		result = append(result, obj.IntSlice[0])
+	}
+
+	return result
+}
 ```
 
 ##  Benchmark

Leetcode/0703.Kth-Largest-Element-in-a-Stream/main.go

@@ -1,2 +1,57 @@
+package kthlargestelementinastream
 
-// 時間複雜 O(), 空間複雜 O()
+import (
+	"container/heap"
+	"sort"
+)
+
+/**
+ * Your KthLargest object will be instantiated and called as such:
+ * obj := Constructor(k, nums);
+ * param_1 := obj.Add(val);
+ */
+
+// 時間複雜 O(), 空間複雜 O()
+type KthLargest struct {
+	sort.IntSlice
+	k int
+}
+
+func Constructor(k int, nums []int) KthLargest {
+	kl := KthLargest{k: k}
+	for _, val := range nums {
+		kl.Add(val)
+	}
+	return kl
+}
+
+func (kl *KthLargest) Add(val int) int {
+	heap.Push(kl, val)
+	if kl.Len() > kl.k {
+		heap.Pop(kl)
+	}
+	return kl.IntSlice[0]
+}
+
+func (kl *KthLargest) Push(v interface{}) {
+	kl.IntSlice = append(kl.IntSlice, v.(int))
+}
+
+func (kl *KthLargest) Pop() interface{} {
+	// 拿出最後一筆
+	a := kl.IntSlice
+	v := a[len(a)-1]
+	kl.IntSlice = a[:len(a)-1]
+	return v
+}
+
+func KthLargestStream(k int, nums []int, elem []int) []int {
+	obj := Constructor(k, nums)
+	result := []int{0}
+	for _, val := range elem {
+		obj.Add(val)
+		result = append(result, obj.IntSlice[0])
+	}
+
+	return result
+}

Leetcode/0703.Kth-Largest-Element-in-a-Stream/main_test.go

@@ -1,30 +1,37 @@
-package 
+package kthlargestelementinastream
 
-import "testing"
+import (
+	"reflect"
+	"testing"
+)
 
 var tests = []struct {
-	arg1 string
-	want int
+	arg1 int
+	arg2 []int
+	arg3 []int
+	want []int
 }{
 	{
-		"bbbab",
-		4,
+		3,
+		[]int{4, 5, 8, 2},
+		[]int{3, 5, 10, 9, 4},
+		[]int{0, 4, 5, 5, 8, 8},
 	},
 }
 
-func TestLongestPalindromeSubseq(t *testing.T) {
+func TestKthLargestStream(t *testing.T) {
 	for _, tt := range tests {
-		// if got := ReverseList(tt.arg1); !reflect.DeepEqual(got, tt.want) {
-		if got := LongestPalindromeSubseq(tt.arg1); got != tt.want {
+		if got := KthLargestStream(tt.arg1, tt.arg2, tt.arg3); !reflect.DeepEqual(got, tt.want) {
+			// if got := KthLargestStream(tt.arg1, tt.arg2, tt.arg3); got != tt.want {
 			t.Errorf("got = %v, want = %v", got, tt.want)
 		}
 	}
 }
 
-func BenchmarkLongestPalindromeSubseq(b *testing.B) {
+func BenchmarkKthLargestStream(b *testing.B) {
 	b.ResetTimer()
 	for i := 0; i < b.N; i++ {
-		LongestPalindromeSubseq(tests[0].arg1)
+		KthLargestStream(tests[0].arg1, tests[0].arg2, tests[0].arg3)
 	}
 }