[프로그래머스/Java] Lv.0 유한소수 판별하기
문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 import java.util.HashSet; import java.util.Iterator; class Solution { public static int getGCD(int num1, int num2) { if(num1%num2==0) { return num2; } return getGCD(num2, num1%num2); } public int solution(int a, int b) { int answer=0; int bb=b/getGCD(a,b); HashSet s=new HashSet(); int n=bb..