Skip to content

Commit 6076096

Browse files
committed
[level 1] Title: 정수 내림차순으로 배치하기, Time: 0.40 ms, Memory: 73.9 MB -BaekjoonHub
1 parent ce5bac4 commit 6076096

2 files changed

Lines changed: 6 additions & 10 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?language=java)
3+
[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/12933)
44

55
### 성능 요약
66

7-
메모리: 79.3 MB, 시간: 1.78 ms
7+
메모리: 73.9 MB, 시간: 0.40 ms
88

99
### 구분
1010

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

1717
### 제출 일자
1818

19-
2026년 06월 19일 14:32:21
19+
2026년 06월 23일 09:07:48
2020

2121
### 문제 설명
2222

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

Lines changed: 3 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -2,12 +2,8 @@
22

33
class Solution {
44
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);
5+
char[] arr = String.valueOf(n).toCharArray();
6+
Arrays.sort(arr);
7+
return Long.parseLong(new StringBuilder(new String(arr)).reverse().toString());
128
}
139
}

0 commit comments

Comments
 (0)