leetcode881 -- Boats to Save People

# 小郑之家~

### 题目

The i-th person has weight people[i], and each boat can carry a maximum weight of limit.

Each boat carries at most 2 people at the same time, provided the sum of the weight of those people is at most limit.

Return the minimum number of boats to carry every given person.  (It is guaranteed each person can be carried by a boat.)

Example 1:

Input: people = [1,2], limit = 3
Output: 1
Explanation: 1 boat (1, 2)
Example 2:

Input: people = [3,2,2,1], limit = 3
Output: 3
Explanation: 3 boats (1, 2), (2) and (3)
Example 3:

Input: people = [3,5,3,4], limit = 5
Output: 4
Explanation: 4 boats (3), (3), (4), (5)



class Solution(object):
def numRescueBoats(self, people, limit):
"""
:type people: List[int]
:type limit: int
:rtype: int
"""
#people.sort()
# 1,2,2,3,limit=3
# 1,2,4,5,limit=6.

people.sort()
i,j = 0, len(people)-1
res = 0
while i<=j:
summ = people[i]+people[j]
if summ <= limit:
res +=1
i += 1
j -= 1

else:
res += 1
j -= 1

return res



class Solution(object):
def numRescueBoats(self, people, limit):
"""
:type people: List[int]
:type limit: int
:rtype: int
"""
#people.sort()
# 1,2,2,3,limit=3
# 1,2,4,5,limit=6.

people.sort()
i,j = 0, len(people)-1
res = 0
while i<=j:
summ = people[i]+people[j]
if summ <= limit:
i += 1
res += 1
j -= 1

return res


### 为何是 while i<= j

class Solution:
def numRescueBoats(self, people: List[int], limit: int) -> int:

i,j = 0, len(people)-1

people.sort()
res = 0

while i<=j:
if i==j:
summ = people[i]   # 因为这时候i和j是重合的,
else:
summ = people[i]+people[j]

res += 1
j -= 1

if summ <= limit:
i += 1

return res