-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathSubstringComparison.java
92 lines (61 loc) · 2.28 KB
/
SubstringComparison.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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/*
We define the following terms:
Lexicographical Order, also known as alphabetic or dictionary order, orders characters as follows:
For example, ball < cat, dog < dorm, Happy < happy, Zoo < ball.
A substring of a string is a contiguous block of characters in the string. For example, the substrings of abc are a, b, c, ab, bc, and abc.
Given a string,
, and an integer, , complete the function so that it finds the lexicographically smallest and largest substrings of length
.
Function Description
Complete the getSmallestAndLargest function in the editor below.
getSmallestAndLargest has the following parameters:
string s: a string
int k: the length of the substrings to find
Returns
string: the string ' + "\n" + ' where and are the two substrings
Input Format
The first line contains a string denoting
.
The second line contains an integer denoting
.
Constraints
consists of English alphabetic letters only (i.e., [a-zA-Z]).
Sample Input 0
welcometojava
3
Sample Output 0
ava
wel
Explanation 0
String
has the following lexicographically-ordered substrings of length
:
We then return the first (lexicographically smallest) substring and the last (lexicographically largest) substring as two newline-separated values (i.e., ava\nwel).
The stub code in the editor then prints ava as our first line of output and wel as our second line of output.
*/
import java.util.Scanner;
public class Solution {
public static String getSmallestAndLargest(String s, int k) {
String smallest = s.substring(0, k);
String largest = s.substring(0, k);
for(int i = 0; i <= s.length() - k; i++){
String stringTemp = s.substring(i, i + k);
if(stringTemp.compareTo(smallest) < 0) {
smallest = stringTemp;
}
if(stringTemp.compareTo(largest) > 0) {
largest = stringTemp;
}
}
//if smallest.charAt(0)>k:
//largest.compareTo(smallest)>0;
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));
}
}