Skip to content

Commit cea33df

Browse files
authored
Create minimum-number-of-operations-to-make-array-continuous.cpp
1 parent 51814f4 commit cea33df

File tree

1 file changed

+35
-0
lines changed

1 file changed

+35
-0
lines changed
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
// Time: O(nlogn)
2+
// Space: O(n)
3+
4+
class Solution {
5+
public:
6+
int minOperations(vector<int>& nums) {
7+
const int n = size(nums);
8+
sort(begin(nums), end(nums));
9+
nums.erase(unique(begin(nums), end(nums)), end(nums));
10+
int result = 0, l = 0;
11+
for (int i = 0; i < size(nums); ++i) {
12+
if (nums[i] <= nums[i - l] + n - 1) {
13+
++l;
14+
}
15+
}
16+
return n - l;
17+
}
18+
};
19+
20+
// Time: O(nlogn)
21+
// Space: O(n)
22+
class Solution2 {
23+
public:
24+
int minOperations(vector<int>& nums) {
25+
const int n = size(nums);
26+
sort(begin(nums), end(nums));
27+
nums.erase(unique(begin(nums), end(nums)), end(nums));
28+
int result = 0;
29+
for (int left = 0, right = 0; left < size(nums); ++left) {
30+
for (; right < size(nums) && nums[right] <= nums[left] + n - 1; ++right);
31+
result = max(result, right - left);
32+
}
33+
return n - result;
34+
}
35+
};

0 commit comments

Comments
 (0)