최고다최코딩

public int solution(int[] sides) {

Arrays.sort(sides);

if(sides[2]<sides[0]+sides[1])

return 1;

return 2;

}

public int solution(int[] sides) {

Arrays.sort(sides);

int answer = (sides[2]<sides[0]+sides[1]) ? 1: 2;

return answer;

}

public int solution(int n) {

int answer = 0;

boolean isSquare = false;

for (int i = 1; i * i <= n; i++) {

if (i * i == n)

isSquare = true;

if (n % i == 0) {

answer++;

}

}

answer *= 2;

if (isSquare)

answer--;

return answer;

}

public int solution2(int n) {

int answer = 0;

for (int i = 1; i * i <= n; i++) {

if (i * i == n) answer++;

else if (n % i == 0) {

answer+=2;

}

}

return answer;

}

public int solution(String[] s1, String[] s2) {

int answer = 0;

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

for (int j = 0; j < s1.length; j++) {

if(s1[j].equals(s2[i])) {

answer++;

}

}

}

return answer;

}

public int solution2(String[] s1, String[] s2) {

int answer = 0;

Set<String> set = new HashSet<String>();

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

set.add(s1[i]);

}

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

set.add(s2[i]);

}

answer =s1.length+s2.length-set.size();

return answer;

}

public String solution(String my_string) {

String answer = "";

char[] arr = my_string.toCharArray();

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

char temp = arr[i];

arr[i] = arr[arr.length-i-1];

arr[arr.length-1-i]=temp;

}

answer = String.valueOf(arr);

return answer;

}

public String solution2(String my_string) {

return new StringBuilder(my_string).reverse().toString();

}

public String solution3(String my_string) {

String answer = "";

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

answer+=my_string.charAt(my_string.length()-1-i);

}

return answer;

}