We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent a8acaa5 commit 095bc4cCopy full SHA for 095bc4c
C++/k-empty-slots.cpp
@@ -0,0 +1,22 @@
1
+// Time: O(n)
2
+// Space: O(n)
3
+
4
+class Solution {
5
+public:
6
+ int kEmptySlots(vector<int>& flowers, int k) {
7
+ vector<int> days(flowers.size());
8
+ for (int i = 0; i < flowers.size(); ++i) {
9
+ days[flowers[i] - 1] = i;
10
+ }
11
+ auto result = numeric_limits<int>::max();
12
+ for (int i = 0, left = 0, right = k + 1; right < days.size(); ++i) {
13
+ if (days[i] < days[left] || days[i] <= days[right]) {
14
+ if (i == right) {
15
+ result = min(result, max(days[left], days[right]));
16
17
+ left = i, right = k + 1 + i;
18
19
20
+ return (result == numeric_limits<int>::max()) ? -1 : result + 1;
21
22
+};
0 commit comments