코드 리뷰 부탁드립니다!

2021-06-04T02:40:32.505Z

447

재현

function solution(A,M){

 let stack = [];
 let n = A.length;
 let answer=0;

 for(let x of M){

  for(let i=0; i<n; i++){
  if(A[i][x-1]>0){
    stack.push(A[i][x-1]);
    A[i][x-1] = 0;
 
   break; 
   } 

 let m = stack.length;
 for(let j=0; j<m; j++){
    if(stack[j]===stack[j+1]){
    while(stack.pop() ===stack[j]);
   answer +=2;
    }
 } 
 }
 }
 
 return answer;
}

let board = [
[0,0,0,0,0],
[0,0,1,0,3],
[0,2,5,0,1],
[4,2,4,4,2],
[3,5,1,3,1]
];

let moves = [1,5,3,5,1,2,1,4];

console.log(solution(board,moves));

답변 0