-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsortString.java
96 lines (76 loc) · 2.55 KB
/
sortString.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
93
94
95
96
public class Main
{
public static void main(String[] args) {
System.out.println("Hello World");
}
}
import java.util.Arrays;
class Test {
// length of result string should be equal to sum of two strings
static boolean checkLength(String first, String second, String result) {
if (first.length() + second.length() != result.length()) {
return false;
}
else {
return true;
}
}
// this method converts the string to char array
// sorts the char array
// convert the char array to string and return it
static String sortString(String str) {
char[] charArray = str.toCharArray();
Arrays.sort(charArray);
// convert char array back to string
str = String.valueOf(charArray);
return str;
}
// this method compares each character of the result with
// individual characters of the first and second string
static boolean shuffleCheck(String first, String second, String result) {
// sort each string to make comparison easier
first = sortString(first);
second = sortString(second);
result = sortString(result);
// variables to track each character of 3 strings
int i = 0, j = 0, k = 0;
// iterate through all characters of result
while (k != result.length()) {
// check if first character of result matches
// with first character of first string
if (i < first.length() && first.charAt(i) == result.charAt(k))
i++;
// check if first character of result matches
// with the first character of second string
else if (j < second.length() && second.charAt(j) == result.charAt(k))
j++;
// if the character doesn't match
else {
return false;
}
// access next character of result
k++;
}
// after accessing all characters of result
// if either first or second has some characters left
if(i < first.length() || j < second.length()) {
return false;
}
return true;
}
public static void main(String[] args) {
String first = "XY";
String second = "12";
String[] results = {"1XY2", "Y1X2", "Y21XX"};
// call the method to check if result string is
// shuffle of the string first and second
for (String result : results) {
if (checkLength(first, second, result) == true && shuffleCheck(first, second, result) == true) {
System.out.println(result + " is a valid shuffle of " + first + " and " + second);
}
else {
System.out.println(result + " is not a valid shuffle of " + first + " and " + second);
}
}
}
}