풀이
function solution(priorities,location){
var printCnt = 0;
while(priorities.length!=0){
var first = priorities.shift();
if(priorities.filter(x=>x>first).length>0){ //first 보다 중요도가 높은 문서가 존재하면
priorities.push(first); //맨뒤로 이동
}else{
printCnt++;
if(location==0){
return printCnt;
}
}
location--; //기준값 -1
if(location==-1){
location = priorities.length-1; //맨처음값이였으면 맨 뒤로 옮겨줌
}
}
}