Algorithm/Programmers

[LV2/JAVA] ์ตœ๋Œ“๊ฐ’๊ณผ ์ตœ์†Ÿ๊ฐ’

carsumin 2024. 10. 2. 17:45

https://school.programmers.co.kr/learn/courses/30/lessons/12939

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr

 

1. ๋ฌธ์ž์—ด์„ ๋ฌธ์žํ˜• ๋ฐฐ์—ด์— ๋‹ด๋Š”๋‹ค.

String[] sArr = s.split(" ");

 

2. ์ตœ๋Œ€, ์ตœ์†Œ๋ฅผ ๋น„๊ตํ•˜๊ธฐ ์œ„ํ•œ ์ดˆ๊ธฐ๊ฐ’์„ ์„ค์ •ํ•œ๋‹ค. ์—ฌ๊ธฐ์„œ max, min์˜ ๊ฐ’์€ ๋ฐฐ์—ด์„ ์ˆœํšŒํ•˜๋ฉด์„œ ๋น„๊ตํ•  ๊ฒƒ์ด๊ธฐ ๋•Œ๋ฌธ์— ์•„๋ฌด๊ฑฐ๋‚˜ ์ƒ๊ด€์—†๋‹ค.

3. ํ–ฅ์ƒ๋œ For๋ฌธ์œผ๋กœ ๋ฌธ์žํ˜• ๋ฐฐ์—ด์„ ์ˆœํšŒํ•œ๋‹ค.

4. ๋ฌธ์žํ˜• answer์„ ๋ฆฌํ„ดํ•œ๋‹ค.

class Solution {
    public String solution(String s) {
        String answer = "";
        //๋ฌธ์žํ˜• ๋ฐฐ์—ด
        String[] sArr = s.split(" ");
        
        //max, min ์ดˆ๊ธฐ๊ฐ’ ์„ค์ •
        int max = Integer.parseInt(sArr[0]);
        int min = Integer.parseInt(sArr[0]);
        
        //sArr ์ˆœํšŒ
        for(String str:sArr){
            int tmp = Integer.parseInt(str);
            if(tmp > max) max = tmp;
            if(tmp < min) min = tmp;
        }
        
        answer += min + " " + max;
        return answer;
    }
}