📚 문제

그리디 - https://programmers.co.kr/learn/courses/30/lessons/42883

💡 접근

⌨️ 코드

function solution(number, k) {
  let stack = [];
  for (let i in number) {
    let value = number[i];

    while (k > 0 && stack[stack.length - 1] < value) {
      stack.pop();
      k--;
    }

    stack.push(value);
  }

  stack.splice(number.length - k, k);
  return stack.join("");
}

📝 리뷰