按步骤来确定函数图像:
- 确定自变量。题目问什么,什么就是自变量,所以这里船的运载能力就是自变量x。运输天数和运载能力成反比。
- target是运输天数,我们要在f(x) == D的限制下求出船最小载重
- x的范围。即最小载重和最大载重,left肯定是所有货物中最大的那个,因为至少得装一个货物。最大的就是所有货物的总重量,也就是一次就把货物全带走的极端情况
所以题目又变成了和875爱吃香蕉的珂珂一样,在单调递减函数中,f(x) == D的条件下,求最小的承载能力x
class Solution {
public:
int f(vector<int>& weights, int bear)
{
int days = 0;
for (int i = 0; i < weights.size();)
{
int cap = bear;
while (i < weights.size())
{
if (cap < weights[i])
break;
else
cap -= weights[i];
i++;
}
days++;
}
return days;
}
int shipWithinDays(vector<int>& weights, int days)
{
int left = 0, right = 1; //因为区间是[left, right),所以right要多1
for (int i = 0; i < weights.size(); i++)
{
if (weights[i] > left)
left = weights[i];
right += weights[i];
}
while (left < right)
{
int mid = left + (right - left) / 2;
if (f(weights, mid) < days)
right = mid;
else if (f(weights, mid) > days)
left = mid + 1;
else
right = mid;
}
return left;
}
};
如果题目中存在单调关系就可以尝试用二分搜索的思路