题目描述:
There is a garden with N slots. In each slot, there is a flower. The N flowers will bloom one by one in N days. In each day, there will be exactly one flower blooming and it will be in the status of blooming since then.
Given an array flowers consists of number from 1 to N. Each number in the array represents the place where the flower will open in that day.
For example, flowers[i] = x means that the unique flower that blooms at day i will be at position x, where i and x will be in the range from 1 to N.
Also given an integer k, you need to output in which day there exists two flowers in the status of blooming, and also the number of flowers between them is k and these flowers are not blooming.
If there isn't such day, output -1.
Example 1:
Input:
flowers: [1,3,2]
k: 1
Output: 2
Explanation: In the second day, the first and the third flower have become blooming.
Example 2:
Input:
flowers: [1,2,3]
k: 1
Output: -1
Note: The given array will be in the range [1, 20000].
class Solution {
public:
int kEmptySlots(vector<int>& flowers, int k) {
vector<int> days(flowers.size()+1,0);
//days[i]=x表示i位置的花在第x天开
for(int i=0;i<flowers.size();i++) days[flowers[i]]=i+1;
int i=1;
int j=2;
set<int> s;
int result=INT_MAX;
while(j<days.size())
{
if(j-i<k+1)
{
s.insert(days[j]);
j++;
}
else
{
// 当k==0时,set为空
if(s.empty()||*s.begin()>max(days[i],days[j]))
result=min(result,max(days[i],days[j]));
// i,j更新和set更新的顺序不能搞错,当k==0即j==i+1时,必须先插入days[j]再删除days[i]
s.insert(days[j]);
j++;
i++;
s.erase(days[i]);
}
}
if(result==INT_MAX) return -1;
else return result;
}
};