-
Notifications
You must be signed in to change notification settings - Fork 2
/
Java Substring Comparisons.java
44 lines (34 loc) · 1.13 KB
/
Java Substring Comparisons.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
/* *
* Author: Tonmoy Mondal
* URL: https://qinetique.github.io
* */
/*JAVA-7*/
import java.util.Scanner;
public class Solution {
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'
String string = s.substring(0,k);
smallest = string;
largest = string;
for (int i =0; i < s.length()-k+1; i++){
if (s.substring(i, i+k).compareTo(smallest) < 0){
smallest = s.substring(i, i+k);
}
if (s.substring(i, i+k).compareTo(largest) > 0){
largest = s.substring(i, i+k);
}
}
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));
}
}