-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathsubstringComparison.java
More file actions
34 lines (28 loc) · 1.04 KB
/
substringComparison.java
File metadata and controls
34 lines (28 loc) · 1.04 KB
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
import java.util.Scanner;
public class substringComparison {
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'
for(int i = 0;i<=s.length()-k;i++){
String subString = s.substring(i,i+k);
if(i == 0){
smallest = subString;
}
if(subString.compareTo(largest)>0){
largest = subString;
}else if(subString.compareTo(smallest)<0)
smallest = subString;
}
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));
}
}