[입문][JAVA][02.13] 프로그래머스 코딩테스트

몫 구하기

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 = num1%num2;
        return answer;
    }
}

두 수의 차

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;
        }
        return answer;
    }
}

나이 출력

class Solution {
    public int solution(int age) {
        int answer = 2022-age+1;
        return answer;
    }
}

두 수의 곱

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

배열의 평균값

import java.util.stream.*;

class Solution {
    public double solution(int[] numbers) {
        return IntStream.of(numbers).average().orElse(0.0);
    }
}

각도기

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

양꼬치

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

짝수의 합

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

피자 나눠 먹기 (3)

class Solution {
    public int solution(int slice, int n) {
        int answer = n/slice;
        if(n%slice>0){
            answer++;
        }
        return answer;
    }
}

문자열안에 문자열

class Solution {
    public int solution(String str1, String str2) {
        int answer = 2;
        if(str1.contains(str2)){
            answer = 1;
        }
        return answer;
    }
}

배열 뒤집기

class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = new int[num_list.length];
        int count=0;
        for(int i = num_list.length-1; i >= 0; i--){
            answer[count++] = num_list[i]; 
        }
        return answer;
    }
}

최댓값 만들기 (1)

import java.util.*;
class Solution {
    public int solution(int[] numbers) {
        int answer = 0;
        Arrays.sort(numbers);
        answer = numbers[numbers.length-1] * numbers[numbers.length-2];
        return answer;
    }
}

편지

class Solution {
    public int solution(String message) {
        int answer = message.length()*2;
        return answer;
    }
}

세균 증식

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

특정 문자 제거하기

class Solution {
    public String solution(String my_string, String letter) {
        String answer = my_string.replace(letter, "");
        return answer;
    }
}

순서쌍의 개수

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

문자 반복 출력하기

class Solution {
    public String solution(String my_string, int n) {
        String answer = "";
        for(int i = 0; i < my_string.length(); i++){
            for(int j = 0; j < n; j++){
                answer+=my_string.charAt(i);
            }
        }
        return answer;
    }
}

배열 자르기

import java.util.*;

class Solution {
    public int[] solution(int[] numbers, int num1, int num2) {
        int[] answer = Arrays.copyOfRange(numbers, num1, num2 + 1);
        return answer;
    }
}