-
Notifications
You must be signed in to change notification settings - Fork 856
/
BigSorting.java
61 lines (50 loc) · 1.27 KB
/
BigSorting.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/**
*
* Problem Statement-
* [Big Sorting](https://www.hackerrank.com/challenges/big-sorting/problem)
*
*/
package com.javaaid.hackerrank.solutions.algorithms.strings;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
/**
* @author Kanahaiya Gupta
*
*/
public class BigSorting {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
String[] unsorted = new String[n];
for (int unsorted_i = 0; unsorted_i < n; unsorted_i++) {
unsorted[unsorted_i] = in.next();
}
Arrays.sort(unsorted, new Comparator<String>() {
public int compare(String s1, String s2) {
return compareStrings(s1, s2);
}
});
printArray(unsorted);
in.close();
}
private static int compareStrings(String s1, String s2) {
if (s1.length() < s2.length()) {
return -1;
} else if (s1.length() > s2.length()) {
return 1;
}
for (int k = 0; k < s1.length(); k++) {
if ((int) s1.charAt(k) < (int) s2.charAt(k))
return -1;
if ((int) s1.charAt(k) > (int) s2.charAt(k))
return 1;
}
return 0;
}
private static void printArray(String[] unsorted) {
for (String string : unsorted) {
System.out.println(string);
}
}
}