File tree 2 files changed +26
-0
lines changed
2 files changed +26
-0
lines changed Original file line number Diff line number Diff line change 390
390
| 1539 | [ Kth Missing Positive Number] ( https://leetcode.com/problems/kth-missing-positive-number ) | [ ![ Java] ( assets/java.png )] ( src/KthMissingPositiveNumber.java ) | |
391
391
| 1544 | [ Make The String Great] ( https://leetcode.com/problems/make-the-string-great ) | [ ![ Java] ( assets/java.png )] ( src/MakeTheStringGreat.java ) | |
392
392
| 1550 | [ Three Consecutive Odds] ( https://leetcode.com/problems/three-consecutive-odds ) | [ ![ Java] ( assets/java.png )] ( src/ThreeConsecutiveOdds.java ) | |
393
+ | 1556 | [ Thousand Separator] ( https://leetcode.com/problems/thousand-separator ) | [ ![ Java] ( assets/java.png )] ( src/ThousandSeparator.java ) | |
Original file line number Diff line number Diff line change
1
+ import java .util .LinkedList ;
2
+
3
+ public class ThousandSeparator {
4
+ public String thousandSeparator (int n ) {
5
+ final LinkedList <Integer > list = getDigits (n );
6
+ final StringBuilder result = new StringBuilder ();
7
+ for (int i = 3 ; !list .isEmpty () ; i = (i + 1 ) % 3 ) {
8
+ if (i == 0 ) result .append ('.' );
9
+ result .append (list .pop ());
10
+ }
11
+ return result .reverse ().toString ();
12
+ }
13
+
14
+ private LinkedList <Integer > getDigits (int number ) {
15
+ final LinkedList <Integer > result = new LinkedList <>();
16
+ if (number == 0 ) {
17
+ result .add (0 );
18
+ }
19
+ while (number > 0 ) {
20
+ result .add (number % 10 );
21
+ number /= 10 ;
22
+ }
23
+ return result ;
24
+ }
25
+ }
You can’t perform that action at this time.
0 commit comments