JAVA code two liner


  • 0
    T
    class Solution {
        public int findKthLargest(int[] nums, int k) {
            Arrays.sort(nums);
            return nums[nums.length-k];
        }
    }

  • 0
    P

    Sure! But your solution is nlog(n), the time complexity can definitely be more optimal if you use the concept of max heap, in which case it won't be a two liner.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.