2020. 3. 20. 12:41
자연수 n을 뒤집어 각 자리 숫자를 원소로 가지는 배열 형태로 리턴해주세요. 예를들어 n이 12345이면 [5,4,3,2,1]을 리턴합니다.제한 조건
- n은 10,000,000,000이하인 자연수입니다.
입출력 예
nreturn
12345 | [5,4,3,2,1] |
1 2 3 4 5 6 7 8 9 10 11 12 13 | <code class = "hljs cpp" ><span class = "hljs-class" ><span class = "hljs-keyword" > class </span> <span class = "hljs-title" >Solution</span> {</span> <span class = "hljs-keyword" > public </span> <span class = "hljs-keyword" > int </span>[] <span class = "hljs-built_in" >solution</span>(<span class = "hljs-keyword" > long </span> n) { <span class = "hljs-keyword" > int </span> [] answer = <span class = "hljs-keyword" > new </span> <span class = "hljs-keyword" > int </span>[(<span class = "hljs-keyword" > int </span>)Math.<span class = "hljs-built_in" >log10</span>(n)+<span class = "hljs-number" > 1 </span>]; <span class = "hljs-keyword" > for </span>(<span class = "hljs-keyword" > int </span> i=<span class = "hljs-number" > 0 </span>; i<answer.length; i++) { <span class = "hljs-keyword" > long </span> a = n%<span class = "hljs-number" > 10 </span>; answer[i] = (<span class = "hljs-keyword" > int </span>)a; n = n/<span class = "hljs-number" > 10 </span>; } <span class = "hljs-keyword" > return </span> answer; } } </code> |
'java' 카테고리의 다른 글
(프로그래머스)탑 (0) | 2020.03.25 |
---|---|
(프로그래머스)자릿수 더하기 (0) | 2020.03.20 |
(프로그래머스)정수 내림차순으로 배치하기 (0) | 2020.03.20 |
(프로그래머스)정수 제곱근 판별 (0) | 2020.03.20 |
(프로그래머스)제일 작은 수 제거하기 (0) | 2020.03.20 |