problem0703

README

703. Kth Largest Element in a Stream

题目

Design a class to findthe kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.

YourKthLargestclass will have a constructor which accepts an integer k and an integer array nums, which contains initial elements fromthe stream. For each call to the method KthLargest.add, return the element representing the kth largest element in the stream.

Example:

int k = 3; int[] arr = [4,5,8,2]; KthLargest kthLargest = new KthLargest(3, arr); kthLargest.add(3); // returns 4 kthLargest.add(5); // returns 5 kthLargest.add(10); // returns 5 kthLargest.add(9); // returns 8 kthLargest.add(4); // returns 8

Note: You may assume thatnums' length>=k-1and k >=1.

解题思路

见程序注释

Documentation

Index

• type KthLargest
  • func Constructor(k int, nums []int) KthLargest
  • func (kl *KthLargest) Add(val int) int

Types

type KthLargest

type KthLargest struct {
	// contains filtered or unexported fields
}

KthLargest object will be instantiated and called as such: obj := Constructor(k, nums); param_1 := obj.Add(val);

func Constructor

func Constructor(k int, nums []int) KthLargest

Constructor 创建 KthLargest

func (*KthLargest) Add

func (kl *KthLargest) Add(val int) int

Add 负责添加元素