leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1673.cpp (405B)

0 class Solution { 1 public: 2 vector<int> mostCompetitive(const vector<int> &nums, int k) const { 3 vector<int> st; 4 st.reserve(k); 5 6 for (int i = 0; i < size(nums); i++) { 7 while (!st.empty() && k - size(st) < size(nums) - i && st.back() > nums[i]) 8 st.pop_back(); 9 if (size(st) < k) st.push_back(nums[i]); 10 } 11 12 return st; 13 } 14 };