코딩테스트 입문

나머지 구하기

class Solution {
    public int solution(int num1, int num2) {
        int answer = num1%num2;
        return answer;
    }
}

숫자 비교하기

class Solution {
    public int solution(int num1, int num2) {
        int answer = 0;
        if (num1 == num2) {
            answer = 1;
        } else {
            answer = -1;
        }
        return answer;
    }
}

각도기

class Solution {
    public int solution(int angle) {
        int answer = 0;
        if (0 < angle && angle < 90) {
            answer = 1;
        } else if (angle == 90) {
            answer = 2;
        } else if (90 < angle && angle < 180) {
            answer = 3;
        } else if (angle == 180) {
            answer = 4;
        }
        return answer;
    }
}

짝수의 합

class Solution {
    public int solution(int n) {
        int answer = 0;
        for (int i = 0; i <= n; i++) {
            if (i % 2 == 0) {
                answer += i;
            }
        }
        return answer;
    }
}

배열의 평균값

import java.util.Arrays;

class Solution {
    public double solution(int[] numbers) {
        double answer = 0;
        for (int i = 0; i < numbers.length; i++) {
            answer += numbers[i];
        }
        return answer / numbers.length;
    }
}

양꼬치

class Solution {
    public int solution(int n, int k) {
        int answer = 0;
        k -= n / 10;
        answer = 12000 * n + 2000 * k;
        return answer;
    }
}

편지

import java.util.Arrays;

class Solution {
    public int solution(String message) {
        int answer = 0;
        char[] arr = message.toCharArray();
        answer = 2 * arr.length;
        return answer;
    }
}

아이스 아메리카노

class Solution {
    public int[] solution(int money) {
        int[] answer = new int[2];
        answer[0] = money / 5500;
        answer[1] = money % 5500;
        return answer;
    }
}

피자 나눠 먹기(1)

class Solution {
    public int solution(int n) {
        int answer = 0;
        if (n % 7 == 0) {
            answer = n / 7;
        } else {
            answer = 1 + n / 7;
        }
        return answer;
    }
}

점의 위치 구하기

class Solution {
    public int solution(int[] dot) {
        int answer = 0;
        if (dot[0] >= 0 && dot[1] >= 0) {
            answer = 1;
        } else if (dot[0] < 0 && dot[1] >= 0) {
            answer = 2;
        } else if (dot[0] < 0 && dot[1] < 0) {
            answer = 3;
        } else if (dot[0] >= 0 && dot[1] < 0) {
            answer = 4;
        }
        return answer;
    }
}

배열 원소의 길이

class Solution {
    public int[] solution(String[] strlist) {
        int[] answer = new int[strlist.length];
        for (int i = 0; i < answer.length; i++) {
            answer[i] = strlist[i].length();
        }

        return answer;
    }
}

중복된 숫자 개수

import java.util.Arrays;

class Solution {
    public int solution(int[] array, int n) {
        int answer = 0;
        for (int i = 0; i < array.length; i++) {
            if (array[i] == n) {
                answer++;
            }
        }
        return answer;
    }
}

머쓱이보다 키 큰 사람

import java.util.Arrays;

class Solution {
    public int solution(int[] array, int height) {
        int answer = 0;
        Arrays.sort(array);
        for (int i = 0; i < array.length; i++) {
            if (array[i] > height) {
                answer++;
            }
        }
        return answer;
    }
}

짝수는 싫어요

class Solution {
    public int[] solution(int n) {
        int[] answer = new int[(n + 1) / 2];
        for (int i = 0; i < answer.length; i++) {
            if (i + 1 % 2 != 0) {
                answer[i] = 2 * i + 1;
            }
        }
        return answer;
    }
}

옷가게 할인 받기

class Solution {
    public int solution(int price) {
        int answer = 0;
        if (price >= 500000) {
            answer = (int) (price * 0.8);
        } else if (price >= 300000) {
            answer = (int) (price * 0.9);
        } else if (price >= 100000) {
            answer = (int) (price * 0.95);
        } else {
            answer = price;
        }
        return answer;
    }
}

@@@@@@

@@@@@@

@@@@@@