链接:https://leetcode-cn.com/problems/boats-to-save-people/
先把数组排序,然后始终检查最大重量能否和最小重量上一艘船,若不行,则最大重量一人一艘。
class Solution {
public int numRescueBoats(int[] people, int limit) {
Arrays.sort(people);
int p1 = 0;
int p2 = people.length-1;
int ans = 0;
while(p1<=p2)
{
if(people[p1]+people[p2]<=limit)
p1++;
p2--;
ans++;
}
return ans;
}
}