[프로그래머스]최대공약수와 최소공배수

• 문제 & 예시
  

• 소스코드

// 최대공약수와 최소공배수
public class test08 {
	public static void main(String[] args) {
		Solution8 sol = new Solution8();
		int n = 3;
		int m = 12;
		System.out.println(sol.solution(n, m));
	}
}

class Solution8 {
    public int[] solution(int n, int m) {
        int[] answer = new int[2];
        int big = Math.max(n, m);
        int small = Math.min(n, m);
        
        while(small != 0) {
        	int r = big % small;
        	big = small;
        	small = r;
        }
        
        answer[0] = big;
        answer[1] = n * m / big;
//        System.out.println(Arrays.toString(answer));
        return answer;
    }
}

• consol