Leetcode 1482. Minimum Number of Days to Make m Bouquets 简单易懂的二分法以及相似题型

思路

• 典型二分法，左边界为0，右边界不确定，故可直接赋值为INT_MAX
• 然后的难点在判断上，遍历整个数组时
  • 先看当前是否满足mid的天数要求，满足则累加天数
  • 连续天数达到篮子的要求后，篮子数+1，重新累计连续天数
  • 连续天数中断了，重新累计连续天数
  • 每次循环结束，判断篮子数目，满足就退出

代码

bool check(vector<int>& v, int m, int k,int mid)
	{
		int tot=0,c=0;
		for(int i=0;i<v.size();i++)
		{
			if(v[i]<=mid)
			{
				c++;
				if(c==k)
				{
					tot++;
					c=0;
				}
			}
			else c=0;
		}
		if(tot>=m)return true;
		return false;
	}
	int minDays(vector<int>& bloomDay, int m, int k)
	{
		int s=0,e=INT_MAX-1;
		int ans=-1;
		while(s<=e)
		{
			int mid=s+(e-s)/2;
			if(check(bloomDay,m,k,mid))
			{
				ans=mid;
				e=mid-1;
			}
			else
			{
				s=mid+1;
			}
		}
		return ans;
	}

相似题

1. https://leetcode.com/problems/peak-index-in-a-mountain-array/
2. https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/
3. https://leetcode.com/problems/binary-search/
4. https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/
5. https://leetcode.com/problems/koko-eating-bananas/
6. https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/
7. https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/

参考

Binary Search VIDEO SOL with more similar problems