703. Kth Largest Element in a Stream

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element. Implement KthLargest class: KthLargest(int k, int[] nums) Initializes the object with the integer k and the stream of integers nums. int add(int val) Appends the integer val to the stream and returns the elemen..
Algorithm/LeetCode 2022. 5. 5. 10:30
1029. Two City Scheduling

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti. Return the minimum cost to fly every person to a city such that exactly n people arrive in each city. Example 1: Input: costs = [[10,20],[30,200..
Algorithm/LeetCode 2022. 4. 1. 10:30
1