18주차 알고리즘

process.stdin.setEncoding('utf8');//인코딩 하는 방법
process.stdin.on('data', data => {
    const n = data.split(" ");
    const a = Number(n[0]), b = Number(n[1]);
    
    for (let index = 0; index < b; index++) {
        const mystar = '*'.repeat(b);

        console.log(mystar);   
    }
});

const solution = (n, m)=> {
    const a = n;
    const b= m;
    while(m !== 0){
        let temp  = m;
        m = n% m;
        n = temp;            

    }

    let answer = [];
    answer.push(n);
    answer.push(a*b/n);
    return answer;
}

const solution = (n)=> {
    let temp = new Array();
    let reverse;
    let answer = 0;
    while (n!==0) {
         temp.unshift(n%3);
         n = Math.floor(n/3);
    }
  
    [...temp.reverse()];
    let count = 1;
    for (let index = temp.length-1; index >=0; index--) {
        answer += count * temp[index];
        count*=3;
    }
    return answer;
}

const solution = (s=String) => {
    let answer = "";
    let words = s.split(' ');
  
    for (let i = 0; i < words.length; i++) {
        for (let j = 0; j < words[i].length; j++) {
            answer+= j % 2 === 0? words[i][j].toUpperCase():words[i][j].toLowerCase();
        }
        if (i <words.length-1) {
            answer+=' ';
        }
    }
  	return answer;
}

실수 한 것 : 초기 홀수 인덱스가 대문자 일 수도 있기 때문이다.