1class Solution {2 public:3 int findKthLargest(vector<int> &nums, int k) {4 sort(nums.begin(), nums.end());5 int m = nums.size();6 int d = m - k;7 int ans;8 for (int i = 0; i < nums.size(); i++) {9 if (i == d) {10 ans = nums[d];11 }12 }13 return ans;14 }15};
WPM •0 •0
ACC •0 •0
TIME •0