최고다최코딩

public int solution(int a, int b) {

int answer = 0;

while(b%2==0||b%5==0){

if(b%2==0){

b/=2;

}

if(b%5==0){

b/=5;

}

}

return (a%b==0)? 1:2;

}

public int solution(int n) {

int answer = 1;

int count = 1;

do{

if((answer+"").contains("3")||answer%3==0){

answer= answer+ 1;//하고 나서도 다시 체크

count--;

}else{

if(count==n)break;

answer = answer+1;

}

count++;

}while(count<=n);

return answer;

}

public int solution2(int n) {

int answer = 0;

for(int i=0; i<n; i++) {

answer++;

if((answer+"").contains("3")||answer%3==0)i--;

}

return answer;

}

public int solution(String A, String B) {

int answer = 0;

int len = A.length();

A=A+A;

for (int i = 0; i < len; i++) {

String t =A.substring(len-i,2*len-i);

if(t.equals(B))return i;

}

return -1;

}

public int solution2(String A, String B) {

return (B+B).indexOf(A);

}

public String solution(String polynomial) {

String answer = "";

String[] a = polynomial.split(" ");

int x = 0;

int y = 0;

for (int i = 0; i < a.length; i+=2) {

if(a[i].contains("x")) {

x+=Integer.parseInt((a[i].substring(0,a[i].length()-1).equals(""))?"1":a[i].substring(0,a[i].length()-1));

}

else y+=Integer.parseInt(a[i]);

}

return x == 0 ? y==0 ? "0" : y+"" : x==1 ? y==0 ? "x" : "x + "+y : y==0 ? x+"x" : x+"x + "+y;

}