703.数据流中的第K大元素.js

/**
 * @param {number} k
 * @param {number[]} nums
 * 不是最佳实践，最佳实践是用最大堆
 */
var KthLargest = function(k, nums) {
    this.k = k
    this.nums = nums.sort((a,b) => b-a)
};

/** 
 * @param {number} val
 * @return {number}
 */
KthLargest.prototype.add = function(val) {
    this.nums.push(val)
    this.nums.sort((a,b) => b-a)
    return this.nums[this.k-1]
};

/**
 * Your KthLargest object will be instantiated and called as such:
 * var obj = new KthLargest(k, nums)
 * var param_1 = obj.add(val)
 */