-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTCS_CodeVita2020.java
116 lines (98 loc) · 3.34 KB
/
TCS_CodeVita2020.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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
import java.util.*;
public class TCS_CodeVita2020 {
public static String longestSubString(String input) {
if (input == null || input.length() < 1) {
return "";
}
if (input.length() == 2 && input.charAt(0) != input.charAt(1)) {
return String.valueOf(input.charAt(0));
}
if (input.length() == 1) {
return String.valueOf(input.charAt(0));
}
int start = 0;
int end = 0;
for (int i = 0; i < input.length(); i++) {
int len1 = expandFromMiddle(input, i, i);
int len2 = 0;
if ((i + 1) < input.length()) {
len2 = expandFromMiddle(input, i, i + 1);
}
int len = Math.max(len1, len2);
if (len > end - start) {
start = i - ((len - 1) / 2);
end = i + (len / 2);
}
}
String Output = "";
try {
Output = input.substring(start, end + 1);
} catch (Exception e) {
Output = "";
}
return Output;
}
public static int expandFromMiddle(String s, int left, int right) {
if (s == null || left > right) {
return 0;
}
while (left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)) {
--left;
++right;
}
return right - left - 1;
}
public static String[] Solution(String input) {
String[] arr = new String[3];
if (input.isEmpty() || input == null) {
System.out.println("Impossible");
return null;
} else {
String value = longestSubString(input);
if (value.equals(input) || value.length() == input.length()) {
arr[0] = String.valueOf(input.charAt(0));
arr[1] = String.valueOf(input.substring(1, input.length() - 1));
arr[2] = String.valueOf(input.charAt(input.length() - 1));
input = input.replace(value, "");
} else {
arr[0] = value;
if ("".equals(value)) {
System.out.println("Impossible");
return null;
}
input = input.replace(value, "");
value = longestSubString(input);
arr[1] = value;
if ("".equals(value)) {
System.out.println("Impossible");
return null;
}
input = input.replace(value, "");
value = longestSubString(input);
arr[2] = value;
if ("".equals(value)) {
System.out.println("Impossible");
return null;
}
input = input.replace(value, "");
}
}
if (input.isEmpty() || input == null || input.equals("")) {
System.out.println(arr[0]);
System.out.println(arr[1]);
System.out.println(arr[2]);
} else {
System.out.println("Impossible");
return null;
}
return arr;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String input = sc.next();
try{
Solution(input);
}catch(Exception e){
}
}
}