-
Notifications
You must be signed in to change notification settings - Fork 111
/
solution.java
62 lines (48 loc) · 1.71 KB
/
solution.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
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class solution {
// Complete the appendAndDelete function below.
static String appendAndDelete(String s, String t, int k) {
int commonLength = 0;
for (int i = 0; i < java.lang.Math.min(s.length(), t.length()); i++) {
if (s.charAt(i) == t.charAt(i))
commonLength++;
else
break;
}
// need a bigger k to transform s to t or vice versa
if ((s.length() + t.length() - 2 * commonLength) > k) {
return "No";
}
// we have exactly k moves so if k is odd number of distinct digits should be
// odd too
else if ((s.length() + t.length() - 2 * commonLength) % 2 == k % 2) {
return "Yes";
}
// deletion of any one string and addition of characters of other string
else if ((s.length() + t.length() - k) < 0) {
return "Yes";
}
else {
return "No";
}
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
String s = scanner.nextLine();
String t = scanner.nextLine();
int k = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
String result = appendAndDelete(s, t, k);
bufferedWriter.write(result);
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}