Search

๊น€์ง€์ˆ˜

2.๋ฌธ์ œ์ด๋ฆ„
3. ์ˆ˜ํ–‰์‹œ๊ฐ„[์ดˆ(s)]
600
์ข‹์•„์š” ๋ˆ„๋ฅด๊ธฐ
์ข‹์•„์š” ์ˆ˜
: 0
5 more properties
| ์ฝ”๋“œ ์ž‘์„ฑํ•˜๊ธฐ
package algorithm.problem; import java.util.Arrays; public class Budget { //ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ด๋ถ„ํƒ์ƒ‰ ๋ฌธ์ œ ์˜ˆ์‚ฐ public int solution(int[] d, int budget) { int answer = 0; int sum = 0; Arrays.sort(d); System.out.println(Arrays.toString(d)); for (int i = 0; i < d.length; i++) { sum += d[i]; if (sum > budget) break; answer++; } return answer; } public static void main(String[] args) { System.out.println(new Budget().solution(new int[]{2, 2, 3, 3}, 10)); } }
Java
๋ณต์‚ฌ
| ์ฝ”๋“œ ์„ค๋ช…ํ•˜๊ธฐ
โ€ข
d๋ฅผ ์ •๋ ฌํ•œ๋‹ค.
โ€ข
for๋ฌธ์œผ๋กœ ์˜ˆ์‚ฐ์„ ๋„˜๊ธธ๋•Œ๊นŒ์ง€ ํƒ์ƒ‰ํ•˜๋ฉด์„œ ์นด์šดํŠธ ํ•œ๋‹ค.
โ€ข
์นด์šดํŠธ ํ•œ ๊ฒƒ์„ ๋ฐ˜ํ™˜ํ•œ๋‹ค.