Search

์ด์•„์ง„

2.๋ฌธ์ œ์ด๋ฆ„
3. ์ˆ˜ํ–‰์‹œ๊ฐ„[์ดˆ(s)]
2000
์ข‹์•„์š” ๋ˆ„๋ฅด๊ธฐ
์ข‹์•„์š” ์ˆ˜
: 0
5 more properties
| ์ฝ”๋“œ ์ž‘์„ฑํ•˜๊ธฐ
public int solution(int[] d, int budget) { Arrays.sort(d); int answer = 0; int sum = 0; for (int i = 0; i < d.length; i++) { sum += d[i]; if(sum > budget) { break; } answer++; } return answer; }
Java
๋ณต์‚ฌ
| ์ฝ”๋“œ ์„ค๋ช…ํ•˜๊ธฐ
1 ์ตœ๋Œ€ํ•œ ๋งŽ์€ ๋ถ€์„œ๋ฅผ ์ง€์›ํ•˜๊ธฐ ์œ„ํ•ด ์˜ค๋ฆ„์ฐจ์ˆœ ์ •๋ ฌ
2 ์˜ˆ์‚ฐ์„ ๋„˜์ง€ ์•Š์„ ๋•Œ๊นŒ์ง€ sumํ•ด์ฃผ๊ธฐ
3 ๋„˜์œผ๋ฉด break ๊ฑธ์–ด์„œ answer์— +1 ์•ˆํ•˜๋Š” ๊ฒŒ ํ•ต์‹ฌ!