๐ ์ฝ๋ฉํ
์คํธ/๋ฐฑ์ค & ํ๋ก๊ทธ๋๋จธ์ค
[ํ๋ก๊ทธ๋๋จธ์ค][JAVA]Level 2 : ์ต๋๊ฐ๊ณผ ์ต์๊ฐ
deep_lee
2023. 3. 17. 15:36
Level 2์์ ์๋ง ์ ์ผ ์ฌ์ด๋ฌธ์ ์ผ ๊ฒ์ด๋ค.
< ๋ด ํ์ด >
import java.util.*;
class Solution {
public String solution(String s) {
String answer = "";
String[] str=s.split(" ");
ArrayList<Integer> list = new ArrayList<>();
for(int i=0; i<str.length; i++){
list.add(Integer.parseInt(str[i]));
}
Collections.sort(list);
int min = list.get(0);
int max = list.get(list.size()-1);
answer=min+" "+max;
return answer;
}
}
< ๋ ์ข์ ๋ค๋ฅธ๋ถ ์ฝ๋ >
import java.util.*;
class Solution {
public String solution(String s) {
tring[] tmp = str.split(" ");
int min, max, n;
min = max = Integer.parseInt(tmp[0]);
for (int i = 1; i < tmp.length; i++) {
n = Integer.parseInt(tmp[i]);
if(min > n) min = n;
if(max < n) max = n;
}
return min + " " + max;
}
}