-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
40 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,40 @@ | ||
package com.sks.hkr.java.bigNumber; | ||
|
||
import java.math.BigDecimal; | ||
import java.util.Arrays; | ||
import java.util.Comparator; | ||
import java.util.Scanner; | ||
|
||
public class BigDecimalProblem { | ||
|
||
public static void main(String[] args) { | ||
//Input | ||
Scanner sc = new Scanner(System.in); | ||
int n = sc.nextInt(); | ||
String[] s = new String[n + 2]; | ||
for (int i = 0; i < n; i++) { | ||
s[i] = sc.next(); | ||
} | ||
sc.close(); | ||
|
||
// We want to sort in descending order while preserving the contents | ||
// of each String. A comparator can achieve this for us. We convert | ||
// to BigDecimal inside our comparator so that the change is not | ||
// permanent and our String's form for each number is preserved. | ||
Comparator<String> customComparator = new Comparator<String>() { | ||
@Override | ||
public int compare(String s1, String s2) { | ||
BigDecimal a = new BigDecimal(s1); | ||
BigDecimal b = new BigDecimal(s2); | ||
return b.compareTo(a); // descending order | ||
} | ||
}; | ||
|
||
Arrays.sort(s, 0, n, customComparator); | ||
|
||
//Output | ||
for (int i = 0; i < n; i++) { | ||
System.out.println(s[i]); | ||
} | ||
} | ||
} |