/
StringPartition.java
63 lines (56 loc) · 1.29 KB
/
StringPartition.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
package infosys;
import java.util.HashSet;
import java.util.List;
import java.util.Vector;
public class StringPartition {
public static int getMaxPower(int N, String S) {
int power = 0;
HashSet<String> set = new HashSet<>();
if (checkPallindrome(S)) {
power =S.length() * S.length();
} else {
for (int i = 0; i < S.length() - 1; i++) {
for (int j = i + 1; j <= S.length(); j++) {
String s = S.subSequence(i, j) + "";
if (checkPallindrome(s)) {
set.add(s);
}
}
}
}
List<String> words = new Vector<>();
int max = 0;
for (String word : set) {
if (word.length() >= max) {
max = word.length();
words.add(word);
} else {
words.add(0, word);
}
}
int count = 0;
for (int i = words.size() - 1; i >= 0; i--) {
if (count + words.get(i).length() <= N) {
count = count + words.get(i).length();
power = power + words.get(i).length() * words.get(i).length();
}
}
return power;
}
static boolean checkPallindrome(String S) {
boolean flag = false;
String rev = "";
for (int i = S.length() - 1; i >= 0; i--) {
rev = rev + S.charAt(i);
}
if (S.equals(rev)) {
flag = true;
}
return flag;
}
public static void main(String[] args) {
int N = 7;
String S = "aabaccc";
System.out.println(getMaxPower(N, S));
}
}