-
Notifications
You must be signed in to change notification settings - Fork 5
/
JavaSubstringComparisons.java
36 lines (31 loc) · 1.07 KB
/
JavaSubstringComparisons.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
/**
* Mindula Dilthushan
* Hacker Rank - Java
* minduladilthushan1@gmail.com
*/
import java.util.Scanner;
public class JavaSubstringComparisons {
public static String getSmallestAndLargest(String s, int k) {
String smallest = "";
String largest = "";
// Complete the function
// 'smallest' must be the lexicographically smallest substring of length 'k'
// 'largest' must be the lexicographically largest substring of length 'k'
smallest = largest = s.substring(0, k);
for (int i = 1; i < s.length() - k + 1; i++) {
String substr = s.substring(i, i + k);
if (smallest.compareTo(substr) > 0)
smallest = substr;
if (largest.compareTo(substr) < 0)
largest = substr;
}
return smallest + "\n" + largest;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String s = scan.next();
int k = scan.nextInt();
scan.close();
System.out.println(getSmallestAndLargest(s, k));
}
}