-
Notifications
You must be signed in to change notification settings - Fork 0
/
03_Java Substring Comparisons.java
47 lines (39 loc) · 1.19 KB
/
03_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
45
46
47
import java.util.Scanner;
public class Solution {
public static String getSmallestAndLargest(String s, int k)
{
String temp;
String[] ss = new String[s.length()-k+1];
int i=0;
while(k+i<=s.length())
ss[i]=s.substring(i,k+(i++));
for(int j=0;j<ss.length;j++)
for(int m=j;m<ss.length;m++)
if(m!=j)
if(calculator(ss[j],ss[m],0))
{
temp=ss[m];
ss[m]=ss[j];
ss[j]=temp;
}
return ss[0] + "\n" + ss[ss.length-1];
}
public static boolean calculator(String A,String B,int i)
{
if(i>=A.length()||i>=A.length())
return false;
if(A.charAt(i)>B.charAt(i))
return true;
else if(A.charAt(i)==B.charAt(i))
return calculator(A,B,++i);
else
return false;
}
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));
}
}