Skip to content

Commit b9edf69

Browse files
committed
[level 1] Title: 정수 내림차순으로 배치하기, Time: 1.78 ms, Memory: 79.3 MB -BaekjoonHub
1 parent 459598b commit b9edf69

2 files changed

Lines changed: 16 additions & 3 deletions

File tree

프로그래머스/1/12933. 정수 내림차순으로 배치하기/README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
# [level 1] 정수 내림차순으로 배치하기 - 12933
22

3-
[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/12933)
3+
[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/12933?language=java)
44

55
### 성능 요약
66

7-
메모리: 10.3 MB, 시간: 0.02 ms
7+
메모리: 79.3 MB, 시간: 1.78 ms
88

99
### 구분
1010

@@ -16,7 +16,7 @@
1616

1717
### 제출 일자
1818

19-
2024년 06월 20일 12:55:31
19+
2026년 06월 19일 14:32:21
2020

2121
### 문제 설명
2222

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
import java.util.*;
2+
3+
class Solution {
4+
public long solution(long n) {
5+
String s = n+"";
6+
char [] chars = s.toCharArray();
7+
Arrays.sort(chars);
8+
9+
StringBuilder sb = new StringBuilder(new String (chars));
10+
String res = sb.reverse().toString();
11+
return Long.parseLong(res);
12+
}
13+
}

0 commit comments

Comments
 (0)