FilesExpand file tree

 master

/

BoatsToSavePeople885.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

51 lines (49 loc) · 1.21 KB

 master

/

BoatsToSavePeople885.java

Copy path

Top

File metadata and controls

• Code
• Blame

51 lines (49 loc) · 1.21 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

/**

* 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

*/

public class BoatsToSavePeople885 {

public int numRescueBoats(int[] people, int limit) {

Arrays.sort(people);

int res = 0;

int N = people.length;

int i = 0;

int j = N-1;

while (i < j) {

if (people[i] + people[j] > limit) {

j--;

} else {

i++;

j--;

}

res++;

}

if (i == j) res++;

return res;

}

}