2-Line Java Solution, beats 80%


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

Log in to reply
 

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