Portfolio

문제

A conveyor belt has packages that must be shipped from one port to another within days days.

The ith package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights). We may not load more weight than the maximum weight capacity of the ship.

Return the least weight capacity of the ship that will result in all the packages on the conveyor belt being shipped within days days.

Example 1:


Input: weights = [1,2,3,4,5,6,7,8,9,10], days = 5
Output: 15
Explanation: A ship capacity of 15 is the minimum to ship all the packages in 5 days like this:
1st day: 1, 2, 3, 4, 5
2nd day: 6, 7
3rd day: 8
4th day: 9
5th day: 10

Note that the cargo must be shipped in the order given, so using a ship of capacity 14 and splitting the packages into parts like (2, 3, 4, 5), (1, 6, 7), (8), (9), (10) is not allowed.

Example 2:


Input: weights = [3,2,2,4,1,4], days = 3
Output: 6
Explanation: A ship capacity of 6 is the minimum to ship all the packages in 3 days like this:
1st day: 3, 2
2nd day: 2, 4
3rd day: 1, 4

Example 3:


Input: weights = [1,2,3,1,1], days = 4
Output: 3
Explanation:
1st day: 1
2nd day: 2
3rd day: 3
4th day: 1, 1

Constraints:

1 <= days <= weights.length <= 5 * 104

1 <= weights[i] <= 500

풀이

은찬


const shipWithinDays = (weights, days) => {
    let front = 0;
    let back = 0;

    weights.map((w) => {
        front = Math.max(front, w);
        back += w;
    })

    while(front < back) {
        let mid = Math.floor((front + back) / 2);
        let countOfDays = 1;
        let sum = 0;
        
        weights.map((w) => {
            if(w + sum <= mid) {
                sum += w;
            } else{
                sum = w;
                countOfDays++;
            }
        })

        if(countOfDays <= days){
            back = mid;
        } else {
            front = mid + 1;
        }
    }
    
    return front;
};

재영


const getDays = (weights, shipWeight) => {
  let cnt = 0;
  let nowLoadWeight = 0;

  for (const weight of weights) {
    if (nowLoadWeight + weight <= shipWeight) {
      nowLoadWeight += weight;
    } else {
      cnt += 1;
      nowLoadWeight = weight;
    }
  }

  return cnt + !!nowLoadWeight;
};

const parametricSearch = (start, end, weights, days) => {
  while (start <= end) {
    const mid = Math.floor((start + end) / 2);

    const nowDay = getDays(weights, mid);

    if (nowDay <= days) {
      if (getDays(weights, mid - 1) <= days) {
        return parametricSearch(start, mid - 1, weights, days);
      } else {
        return mid;
      }
    } else {
      start = mid + 1;
    }
  }

  return start;
};

/**
 * @param {number[]} weights
 * @param {number} days
 * @return {number}
 */
const shipWithinDays = (weights, days) => {
  const maxWeight = Math.max(...weights);
  const minShipWeight = Math.max(
    maxWeight * Math.ceil(weights.length / days),
    maxWeight
  );

  const result = parametricSearch(maxWeight, minShipWeight, weights, days);

  return result;
};

효성


/**
 * @param {number[]} weights
 * @param {number} days
 * @return {number}
 */
var shipWithinDays = function(weights, days) {
    let start = Math.max(...weights);
    let end = weights.reduce((partialSum, a) => partialSum + a, 0);

    while(start < end) {
        let mid = Math.floor((start + end) / 2);

        if(daysNeeded(weights, mid) <= days) {
            end = mid;
        } else {
            start = mid + 1;
        }
    }
    
    return start;
};

const daysNeeded = (weights, capacity) => {
    let currentShipWeight = 0;
    let numberOfDays = 1;
    
    for (let weight of weights) {
        currentShipWeight += weight;
        
        if (currentShipWeight > capacity) {
            currentShipWeight = weight;
            numberOfDays += 1;    
        }
    }
    
    return numberOfDays;
}

Capacity To Ship Packages Within D Days

문제

풀이