๐ŸŒท๐ŸŒผ๋ชจ์—ฌ๋ด์š” ๊ฐœ๋ฐœ์˜์ˆฒ๐ŸŒท๐ŸŒผ

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์—ฐ์Šต๋ฌธ์ œ/JAVA] ๊ตฌ๋ช…๋ณดํŠธ ๋ณธ๋ฌธ

๊ฐœ๋ฐœ/์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œํ’€์ด JAVA

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์—ฐ์Šต๋ฌธ์ œ/JAVA] ๊ตฌ๋ช…๋ณดํŠธ

์š”์ผ์ด 2022. 9. 26. 23:00
๋ฐ˜์‘ํ˜•

๋ฌธ์ œ

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

 

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

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

programmers.co.kr

 

import java.util.*;

class Solution {
    public int solution(int[] people, int limit) {

        int answer = 0;

        Arrays.sort(people);

        int right = people.length - 1;
        int left = 0;

        while (right >= left) {
            if(people[right] + people[left] > limit) {
                answer++;
                right--;
            }else{
                answer++;
                right--;
                left++;
            }
        }

        return answer;
    }

}

์ฒ˜์Œ์—  for๋ฌธ์œผ๋กœ ํ–ˆ๋‹ค๊ฐ€ ํ•˜๋‚˜ํ•˜๋‚˜ ๋‹ค ๋„๋Š”๊ฒƒ์„ ํ™•์ธํ•˜๊ณ  ์ˆ˜์ •ํ•˜์˜€๋‹ค.

Comments