zoukankan      html  css  js  c++  java
  • LC 881. 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)

    Note:

    • 1 <= people.length <= 50000
    • 1 <= people[i] <= limit <= 30000

    Runtime: 44 ms, faster than 38.51% of Java online submissions for Boats to Save People.

    class Solution {
      public int numRescueBoats(int[] people, int limit) {
        Arrays.sort(people);
        int ret = 0;
        int right = people.length-1;
        int left = 0;
        while(right > left){
          if(people[right] + people[left] <= limit){
            ret++;
            right--;
            left++;
          }else {
            ret++;
            right--;
          }
        }
        if(right == left) ret++;
        return ret;
      }
    }
  • 相关阅读:
    选择排序
    散列冲突解决方案
    string stringbuffer StringBuilder
    java关键字
    Vector
    What is the difference between book depreciation and tax depreciation?
    Type of Asset Books in Oracle Fixed Assets
    questions
    Oracle Express 11g
    iot
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10276481.html
Copyright © 2011-2022 走看看