class Solution public int findKthLargestvectorint& nums int k nth_elementnumsbeginnumsbegin+k-1numsendgreaterint; return numsk-1; ;转换为Go
import "sort"
func findKthLargest(nums []int, k int) int { sort.Slice(nums, func(i, j int) bool { return nums[i] > nums[j] }) return nums[k-1] }
原文地址: https://www.cveoy.top/t/topic/it44 著作权归作者所有。请勿转载和采集!