Search

์ด์†Œ์˜

2.๋ฌธ์ œ์ด๋ฆ„
3. ์ˆ˜ํ–‰์‹œ๊ฐ„[์ดˆ(s)]
334
์ข‹์•„์š” ๋ˆ„๋ฅด๊ธฐ
์ข‹์•„์š” ์ˆ˜
: 0
5 more properties
| ์ฝ”๋“œ ์ž‘์„ฑํ•˜๊ธฐ
package com.likelion.programmers; import java.util.Arrays; public class Budget { // ์˜ˆ์‚ฐ private int solution(int[] d, int budget) { int cnt = 0; Arrays.sort(d); for (int i = 0; i < d.length; i++) { if(budget < d[i]) break; budget -= d[i]; cnt++; } return cnt; } public static void main(String[] args) { Budget main = new Budget(); int[] d = new int[]{1,3, 2, 5, 4}; int budget = 9; System.out.println(main.solution(d, budget)); } }
Java
๋ณต์‚ฌ
| ์ฝ”๋“œ ์„ค๋ช…ํ•˜๊ธฐ
๊ฐ ๋ถ€์„œ๋ณ„ ์‹ ์ฒญํ•œ ๊ธˆ์•ก์„ ๋‹ด์€ ๋ฐฐ์—ด d๋ฅผ ์˜ค๋ฆ„์ฐจ์ˆœ์œผ๋กœ ์ •๋ ฌ
์ž‘์€ ๊ธˆ์•ก์˜ ๋ฌผํ’ˆ๋ถ€ํ„ฐ ๊ตฌ๋งค ์ง€์›์„ ํ•˜์—ฌ์•ผ ์ตœ๋Œ€ํ•œ์˜ ๋ถ€์„œ๋ฅผ ์ง€์›ํ•  ์ˆ˜ ์žˆ๊ธฐ ๋•Œ๋ฌธ
for๋ฌธ์„ ์ด์šฉํ•˜์—ฌ ์ „์ฒด ์˜ˆ์‚ฐ(budget)์—์„œ d[i] ๋นผ์ฃผ๊ธฐ
์ง€์›ํ•œ ๋ถ€์„œ์˜ ์ˆ˜๋ฅผ ์ €์žฅํ•˜๊ธฐ ์œ„ํ•ด cnt++
๋งŒ์•ฝ ๋‚จ์€ ์ „์ฒด ์˜ˆ์‚ฐ๋ณด๋‹ค ์ง€์›ํ•ด์ฃผ์•ผ ํ•  ๊ธˆ์•ก์ธ d[i]๊ฐ€ ๋” ํฌ๋‹ค๋ฉด ํ•ด๋‹น ๋ถ€์„œ๋ถ€ํ„ฐ๋Š” ํ˜„์žฌ ์˜ˆ์‚ฐ์œผ๋กœ ์ง€์›ํ•  ์ˆ˜ ์—†๋Š” ๋ถ€์„œ์ด๋ฏ€๋กœ for๋ฌธ break
์ „์ฒด ์˜ˆ์‚ฐ์œผ๋กœ ์ง€์›ํ•œ ๋ถ€์„œ ์ˆ˜ cnt return