프로그래머스 - 코딩테스트 입문 Day 2

1. 두 수의 나눗셈

---

import java.util.*;

class Solution {
    public int solution(int num1, int num2) {
        return (int)Math.floor((float) num1 / (float) num2 * 1000);
    }
}

 

 

 

2. 숫자 비교하기

---

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

 

 

 

3. 분수의 덧셈

---

class Solution {
    public int[] solution(int numer1, int denom1, int numer2, int denom2) {
        int child = numer1 * denom2 + numer2 * denom1 ;
        int parents = denom1 * denom2;
        
        int maxValue = (parents > child) ? parents : child;
        int minValue = (parents < child) ? parents : child;
        
        int div = Euclidean(maxValue, minValue);
        
        int[] answer = { child / div, parents / div };
        
        return answer;
    }
    
    int Euclidean(int a, int b) {
        if (b == 0)
            return a;
        return Euclidean(b, a % b);
    }
}

 

 

 

4. 배열 두 배 만들기

---

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