Added 25 solutions

This commit is contained in:
rshaghoulian
2017-02-24 00:24:47 -06:00
parent 05ce4b1476
commit af8c2969a4
50 changed files with 1562 additions and 277 deletions
+13 -9
View File
@@ -4,17 +4,22 @@
import java.math.BigDecimal;
import java.util.*;
class Solution{
class Solution {
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();
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) {
@@ -27,8 +32,7 @@ class Solution{
Arrays.sort(s, 0, n, customComparator);
//Output
for(int i=0;i<n;i++)
{
for (int i = 0; i < n; i++) {
System.out.println(s[i]);
}
}