leetcode

Leetcode submissions
git clone git://git.laack.co/leetcode.git
Log | Files | Refs | README

kth-largest-element.cpp (506B)

      1 #include <iostream>
      2 #include <vector>
      3 #include <algorithm>
      4 using namespace std;
      5 //Simple solution that has O(nlog(n)) complexity using built in sort.
      6 
      7 
      8 //Leet Ratings
      9 //       Speed  Memory
     10 //Total  99ms   45.4MB    
     11 //Beats  88.33% 73.57%
     12 
     13 int findKthLargest(vector<int>& nums, int k) {
     14     sort(nums.begin(), nums.end());
     15     return nums[nums.size() - k];
     16 }
     17 
     18 
     19 
     20 int main(){
     21     vector<int> input_vec = {0, 1, 2, 4, 5, 6, 7,7 ,8, 9, 9, 9};
     22     cout << findKthLargest(input_vec, 3) << endl;
     23     return 0;
     24 }