Notice
Recent Posts
Recent Comments
- Today
- Total
06-30 19:14
Tags
- ๊ทธ๋ฆฌ๋
- array
- ๋ฌธ๋ฒ
- ์๋ฐ์์ ์
- dp
- ์์์ ๋ ฌ
- ํ๋ก๊ทธ๋๋จธ์ค
- tree
- ๋ค์ต์คํธ๋ผ
- spring
- ์๋ฃ๊ตฌ์กฐ
- ๋ฐฑ์ค
- MST
- Graph
- Algorithm
- ์ธํด
- leetcode
- database
- ๋ฐ์ดํฐ๋ฒ ์ด์ค
- ๋ฒจ๋งํฌ๋
- ์๋ฐ
- CS
- OOP
- ์กธ์ ์ํ
- java
- ๊ตฌํ
- ๋ฐฑ์๋
- BFS
- pytorch
- PS
Link
Partially Committed
[์ ๋ ฌ] ๊ฐ์ฅ ํฐ ์ (JAVA) ๋ณธ๋ฌธ
728x90
๋ฐ์ํ
SMALL
https://school.programmers.co.kr/learn/courses/30/lessons/42746?language=java
ํ๋ก๊ทธ๋๋จธ์ค
์ฝ๋ ์ค์ฌ์ ๊ฐ๋ฐ์ ์ฑ์ฉ. ์คํ ๊ธฐ๋ฐ์ ํฌ์ง์ ๋งค์นญ. ํ๋ก๊ทธ๋๋จธ์ค์ ๊ฐ๋ฐ์ ๋ง์ถคํ ํ๋กํ์ ๋ฑ๋กํ๊ณ , ๋์ ๊ธฐ์ ๊ถํฉ์ด ์ ๋ง๋ ๊ธฐ์ ๋ค์ ๋งค์นญ ๋ฐ์ผ์ธ์.
programmers.co.kr
import java.io.IOException;
import java.util.Arrays;
import java.util.Comparator;
class Solution {
public String solution(int[] numbers) throws IOException {
StringBuilder answer = new StringBuilder();
String[] result = new String[numbers.length];
for(int i = 0 ; i < numbers.length; i++)
result[i] = String.valueOf(numbers[i]);
Arrays.sort(result, new Comparator<String>(){
@Override
public int compare(String o1, String o2){
return (o2+o1).compareTo(o1+o2);
}
});
for(String e : result)
answer.append(e);
if(answer.charAt(0) == '0') return "0";
return answer.toString();
}
}
728x90
๋ฐ์ํ
LIST
'๐ฅ Algorithm || ๋ฌธ์ ํ์ด > PS' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[์คํ/ํ] ์ฌ๋ฐ๋ฅธ ๊ดํธ (JAVA) (0) | 2022.09.03 |
---|---|
[๋ฐฐ์ด] ๊ฐ์ ์ซ์๋ ์ซ์ด (JAVA) (0) | 2022.09.02 |
[์ ๋ ฌ] K ๋ฒ์งธ์ (JAVA) (0) | 2022.09.02 |
[ํ๋ก๊ทธ๋๋จธ์ค] ํฐ ์ ๋ง๋ค๊ธฐ (0) | 2022.07.14 |
[ํ๋ก๊ทธ๋๋จธ์ค] ๊ฒ์ ๋งต ์ต๋จ๊ฑฐ๋ฆฌ (0) | 2022.07.14 |
Comments