blob: 5dcb40ff79a30354ad713299c186e193f6f0fba4 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#include "leetcode.h"
class Solution {
public:
int minOperations(vector<int> &nums) {
int n = nums.size(), ans = n, j = 0;
sort(nums.begin(), nums.end());
nums.erase(unique(nums.begin(), nums.end()), nums.end());
for (int i = 0; i < nums.size(); ++i) {
while (j < nums.size() && nums[j] < nums[i] + n)
++j;
ans = min(ans, n - j + i);
}
return ans;
}
};
int main() {
Solution obj;
vector<int> nums = {4, 2, 5, 3};
cout << obj.minOperations(nums);
}
|