题目描述
给定一个由若干a和b组成的字符串s,请你计算并返回将该字符串分割成两个非空子字符串(即左子字符串和右子字符串)所能获得的最大得分。
【分割字符串的得分】为左子字符串中a的数量加上右子字符串中b的数量。
分析设计
一道典型的前缀和题目,分别计算左边a的数量和右边b的数量,然后计算各个下标的得分取最大值。
代码实现
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
* @param str string字符串
* @return int整型
*/
public static int StringSplit (String str) {
// write code here
int n = str.length();
int[] cntA = new int[n];
int[] cntB = new int[n];
cntA[0] = (str.charAt(0) == 'a' ? 1 : 0);
for(int i = 1; i < n; ++i){
if(str.charAt(i) == 'a'){
cntA[i] = cntA[i - 1] + 1;
}
else{
cntA[i] = cntA[i - 1];
}
}
cntB[n - 1] = (str.charAt(n - 1) == 'b' ? 1 : 0);
for(int i = n - 2; i >= 0; --i){
if(str.charAt(i) == 'b'){
cntB[i] = cntB[i + 1] + 1;
}
else{
cntB[i] = cntB[i + 1];
}
}
int maxScore = 0;
for(int i = 0; i < n - 1; ++i){
maxScore = Math.max(maxScore, cntA[i] + cntB[i + 1]);
}
return maxScore;
}
public static int StringSplit2 (String str) {
int len = str.length();
int[] countA = new int[len + 1];
int[] countB = new int[len + 1];
int max = Integer.MIN_VALUE;
int diff = 0;
for (int i = 0; i < len; i++) {
if (str.charAt(i) == 'a') {
countA[i + 1] = countA[i] + 1;
countB[i + 1] = countB[i];
} else {
countA[i + 1] = countA[i];
countB[i + 1] = countB[i] + 1;
}
diff = countA[i + 1] - countB[i + 1];
if (diff > max) {
max = diff;
}
}
return max + countB[len];
}
public static void main(String[] args) {
System.out.println(StringSplit("aababbbab"));
System.out.println(StringSplit2("aababbbab"));
System.out.println(StringSplit("aabbababbbaba"));
System.out.println(StringSplit2("aabbababbbaba"));
}
}