[입문][JS][02.16] 프로그래머스 코딩테스트

개미 군단

function solution(hp) {
    var answer = 0;
    if(hp >= 5){
        answer += Math.floor(hp/5);
        hp = hp%5;    
    }
    if(hp >= 3 && hp < 5){
        answer += Math.floor(hp/3);
        hp = hp%3;
    }
    if(hp < 3 && hp > 0){
        answer += Math.floor(hp/1);
    }
    
    
    return answer;
}

가위 바위 보

function solution(rsp) {
    var answer = '';
    for(let a of rsp){
        if(a == '0'){
            answer += '5';
        }else if( a == '2'){
            answer += '0';
        }else{
            answer += '2';
        }
    }
    return answer;
}

숨어있는 숫자의 덧셈 (1)

function solution(my_string) {
    var answer = 0;
    for(let s of my_string){
        if(!isNaN(s)){
            answer += parseInt(s);
        }
    }
    return answer;
}

최댓값 만들기 (2)

function solution(numbers) {
    var answer = numbers[0] * numbers[1];
    for(let i = 0; i < numbers.length-1; i++){
        for(let j = i+1; j < numbers.length; j++){
            if(answer < numbers[i] * numbers[j]){
                answer = numbers[i] * numbers[j];
            }
        }
    }
    return answer;
}

대문자와 소문자

function solution(my_string) {
    var answer = '';
    for(let s of my_string){
        if(s.toUpperCase()==s){
            answer += s.toLowerCase();
        }else{
            answer += s.toUpperCase();
        }
    }
    return answer;
}

인덱스 바꾸기

function solution(my_string, num1, num2) {
    let answer = "";
    answer += my_string.slice(0, num1) + my_string[num2];
    answer += my_string.slice(num1+1, num2) + my_string[num1];
    answer += my_string.slice(num2+1);
    return answer;
}

약수 구하기

function solution(n) {
    var answer = [];
    for(let i = 1; i <= n; i++){
        if(n%i==0){
            answer.push(i);       
        }
    }
    return answer;
}

가장 큰 수 찾기

function solution(array) {
    var answer = [];
    let max = array[0];
    let idx = 0;
    for(let i = 1; i < array.length; i++){
        if(array[i] > max){
            max = array[i];
            idx = i;
        }
    }
    answer.push(max);
    answer.push(idx);
    return answer;
}

문자열 정렬하기 (1)

function solution(my_string) {
    var answer = [];
    for(let s of my_string){
        if(!isNaN(s)){
            answer.push(parseInt(s));
        }
    }
    answer.sort((a, b) => a - b);
    return answer;
}

암호 해독

function solution(cipher, code) {
    var answer = '';
    for(let i = code-1; i < cipher.length; i += code){
        answer += cipher[i];
    }
    return answer;
}

주사위의 개수

function solution(box, n) {
    var answer = 0;
    answer += Math.floor(box[0]/n) * Math.floor(box[1]/n) * Math.floor(box[2]/n);
    return answer;
}

문자열 정렬하기 (2)

function solution(my_string) {
    var answer = '';
    let arr = [];
    for(let s of my_string){
        arr.push(s.toLowerCase());
    }
    arr.sort();
    for(let a of arr){
        answer += a;
    }
    return answer;
}

제곱수 판별하기

function solution(n) {
    var answer = 2;
    let sqrt = Math.sqrt(n);
    if(sqrt==Math.floor(sqrt)){
        answer = 1;
    }
    return answer;
}

피자 나눠 먹기 (2)

function solution(n) {
    var answer = 0;
    let slice = 6;
    while(slice%n!=0){
        answer++;
        slice += 6;
    }
    answer++;
    return answer;
}

외계행성의 나이

function solution(age) {
    var answer = '';
    let alpha = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j'];
    let ageStr = age.toString();
    for(let as of ageStr){
        answer += alpha[parseInt(as)];
    }
    return answer;
}

배열 회전시키기

function solution(numbers, direction) {
    var answer = [];
    let idx = 0;
    if(direction == "right"){
        answer.push(numbers[numbers.length-1]);
        idx = 1;
    }
    for(let i = 1-idx; i < numbers.length-idx; i++){
        answer.push(numbers[i]);
    }
    if(direction == "left"){
        answer.push(numbers[0]);
    }
    
    return answer;
}

369게임

function solution(order) {
    var answer = 0;
    let str = order.toString();
    for(let s of str){
        if(parseInt(s)%3==0 && parseInt(s)!=0){
            answer++;
        }
    }
    return answer;
}

숫자 찾기

function solution(num, k) {
    var answer = -1;
    let numStr = num.toString();
    for(let i = 0; i < numStr.length; i++){
        if(parseInt(numStr[i]) == k){
            answer = i+1;
            break;
        }
    }
    return answer;
}

합성수 찾기

function solution(n) {
    var answer = 0;
    for(let i = 1; i <= n; i++){
        let count = 0;
        for(let j = 1; j <= i; j++){
           if(i%j==0){
               count++;
           }
        }
        if(count>=3){
            answer++;
        }
    }
    return answer;
}

중복된 문자 제거

function solution(my_string) {
    var answer = '';
    for(let str of my_string){
        if(!answer.includes(str)){
            answer += str;
        }
    }
    return answer;
}