-
Notifications
You must be signed in to change notification settings - Fork 40
/
BoatsToSavePeople.js
58 lines (54 loc) · 1.41 KB
/
BoatsToSavePeople.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
// Source : https://leetcode.com/problems/boats-to-save-people
// Author : Dean Shi
// Date : 2018-08-16
/***************************************************************************************
* 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)
*
* Note:
*
* 1 <= people.length <= 50000
* 1 <= people[i] <= limit <= 30000
*
***************************************************************************************/
/**
* @param {number[]} people
* @param {number} limit
* @return {number}
*/
var numRescueBoats = function(people, limit) {
people.sort((a, b) => a - b)
let headPt = 0
let tailPt = people.length - 1
let boat = 0
while(headPt <= tailPt) {
if (people[headPt] + people[tailPt] <= limit) headPt++
tailPt--
boat++
}
return boat
};