forked from bhargav-joshi/LearnFree
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCreate lexicographic strings
43 lines (40 loc) · 1.06 KB
/
Create lexicographic strings
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
// Java program to Compare two strings lexicographically
class Compare {
public static int stringCompare(String str1,
String str2)
{
for (int i = 0; i < str1.length() &&
i < str2.length(); i++) {
if ((int)str1.charAt(i) ==
(int)str2.charAt(i)) {
continue;
}
else {
return (int)str1.charAt(i) -
(int)str2.charAt(i);
}
}
if (str1.length() < str2.length()) {
return (str1.length()-str2.length());
}
else if (str1.length() > str2.length()) {
return (str1.length()-str2.length());
}
else {
return 0;
}
}
// Driver function
public static void main(String args[])
{
String string1 = new String("Heyyy");
String string2 = new String("Coders");
String string3 = new String("practice coding");
String string4 = new String("coding");
System.out.println(stringCompare(string1, string2));
System.out.println(stringCompare(string1, string3));
System.out.println(stringCompare(string2, string1));
System.out.println(stringCompare(string1, string4));
System.out.println(stringCompare(string4, string1));
}
}