-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathHrSubstring.java
More file actions
48 lines (40 loc) · 1.29 KB
/
HrSubstring.java
File metadata and controls
48 lines (40 loc) · 1.29 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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
import java.util.Scanner;
public class HrSubstring {
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'
//char small_char = s.charAt(0);
//char large_char = s.charAt(0);
int length = s.length();
int ans = length - k;
String[] arr = new String[ans+1];
for(int i = 0;i <= ans;i++)
{
arr[i] = s.substring(i,i+k);
}
String smallest = arr[0];
String largest = arr[0];
for(int i = 0;i <= ans;i++)
{
if(smallest.charAt(0) > arr[i].charAt(0))
{
smallest = arr[i];
}
if(largest.charAt(0) < arr[i].charAt(0))
{
largest = arr[i];
}
}
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));
}
}