[프로그래머스] 택배상자

문제의 설명을 그대로 코드로 옮겨보려고 해봤습니다.

function solution(order) {
  let result = 0;
  let containerIndex = 0;
  let subContainerIndex = -1;
  let orderIndex = 0;

  const length = order.length;
  const container = Array.from({ length }, (_, i) => i + 1);
  const subContainer = [];

  while (true) {
    if (result === length) break;

    if (subContainer[subContainerIndex] === order[orderIndex]) {
      result += 1;
      subContainer.pop();
      subContainerIndex -= 1;
      orderIndex += 1;
      continue;
    }

    if (container[containerIndex] === order[orderIndex]) {
      result += 1;
      containerIndex += 1;
      orderIndex += 1;
    } else {
      subContainer.push(container[containerIndex]);

      if (subContainerIndex < length) {
        subContainerIndex += 1;
      }

      if (containerIndex < length) {
        containerIndex += 1;
      }
    }

    if (
      order[orderIndex] < subContainer[subContainerIndex] &&
      container[containerIndex] !== order[orderIndex]
    ) {
      break;
    }
  }

  return result;
}