题目链接:力扣https://leetcode-cn.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/
【分析】其实就是统计连续出现三次的A和连续出现三次的B的个数而已
class Solution {
public boolean winnerOfGame(String colors) {
int n = colors.length();
int i, j, sum1 = 0, sum2 = 0, t1 = 0, t2 = 0;
char c;
for(i = 0; i < n; i++){
c = colors.charAt(i);
if(c == 'A'){
t1++;
t2 -= 2;
if(t2 > 0) sum2 += t2;
t2 = 0;
}else{
t2++;
t1 -= 2;
if(t1 > 0) sum1 += t1;
t1 = 0;
}
}
t2 -= 2; if(t2 > 0) sum2 += t2;
t1 -= 2; if(t1 > 0) sum1 += t1;
return sum1 > sum2 ? true : false;
}
}