leetcode

Solution to some Leetcode problems written in C++

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

2009.cpp (458B)

0 class Solution { 1 public: 2 int minOperations(vector<int> &nums) const { 3 const int n = nums.size(); 4 sort(begin(nums), end(nums)); 5 nums.erase(unique(nums.begin(), nums.end()), nums.end()); 6 7 int res = INT_MIN, j = 0; 8 for (int i = 0; i < nums.size(); i++) { 9 while (j < nums.size() && nums[j] < nums[i] + n) 10 j++; 11 res = max(res, j - i); 12 } 13 return n - res; 14 } 15 };