๐Ÿฅž BE
home

179_Largest Number

๋‹ด๋‹น์ž
์™„๋ฃŒ ์—ฌ๋ถ€
Solved
์š”์•ฝ
๋‚ ์งœ
2024/08/15
ํƒœ๊ทธ
์ •๋ ฌ
๋ฌธ์ž์—ด
๋‚œ์ด๋„
Medium
์ถœ์ฒ˜
LeetCode

์ฝ”๋“œ

import java.util.Arrays; import java.util.Comparator; class Solution { public String largestNumber(int[] nums) { // int ๋ฐฐ์—ด -> String ๋ฐฐ์—ด String[] strNums = new String[nums.length]; for (int i = 0; i < nums.length; i++) { strNums[i] = String.valueOf(nums[i]); } // Comparator ์„ ์–ธ Arrays.sort(strNums, new Comparator<String>() { @Override public int compare(String o1, String o2) { // ๋ฌธ์ž ๋‹จ์œ„๋กœ ํ•ฉ์ณค์„ ๋•Œ ๋” ํฐ๊ฑฐ ๊ตฌํ•˜๊ธฐ. // '30'๊ณผ '9'๊ฐ€ ์žˆ์œผ๋ฉด '309'๊ฐ€ ํฐ์ง€ '930'์ด ํฐ์ง€ ๋น„๊ตํ•œ๋‹ค. String order1 = o1 + o2; String order2 = o2 + o1; return order2.compareTo(order1); } }); // ์—ฃ์ง€์ผ€์ด์Šค. ์ •๋ ฌ ๊ธฐ์ค€ ์ œ์ผ ํฐ ๊ฐ’์ด 0์ด๋ฉด ๊ทธ๋ƒฅ 0๋ฆฌํ„ด if (strNums[0].equals("0")) { return "0"; } // ํ•˜๋‚˜์˜ ๋ฌธ์ž์—ด๋กœ ๊ฒฐ๊ณผ ๋ฆฌํ„ด StringBuilder sb = new StringBuilder(); for (String num : strNums) { sb.append(num); } return sb.toString(); } }
Java
๋ณต์‚ฌ

๋ฌธ์ œ ํ•ด๊ฒฐ ์•„์ด๋””์–ด

๋ฌธ์ž์—ด ๋ฉ”์„œ๋“œ๋ฅผ ํ™œ์šฉํ•ด ์‚ฝ์ž… ์ •๋ ฌ๋กœ ๋น„๊ตํ•˜๋Š” ๋ฌธ์ œ์˜€๋‹ค. Comparator๋ฅผ ํ™œ์šฉํ•˜์—ฌ ๋ฌธ์ž์—ด์„ ํ•ฉ์นœ ๊ฒฐ๊ณผ๊ฐ€ ๋” ํฐ ๋ถ€๋ถ„์„ ํ•˜๋‚˜ํ•˜๋‚˜ ๋น„๊ต ํ›„ ์ •๋ ฌํ•ด๋‚˜๊ฐ€๋ฉฐ ํ•ด๊ฒฐํ–ˆ๋‹ค.