public long numberOfWays(String s) {
char[] array = s.toCharArray();
int n = array.length;
long[][][] dp = new long[2][4][2];
for (int i = 0; i < 2; i++) {
dp[i][0][1] = 1;
dp[i][0][0] = 1;
}
int base = 0;
dp[base][1][array[0] - '0'] = 1;
for (int i = 1; i < n; i++) {
base ^= 1;
for (int j = 1; j < 4; j++) {
dp[base][j][0] = dp[base ^ 1][j][0];
dp[base][j][1] = dp[base ^ 1][j][1];
dp[base][j][array[i] - '0'] += dp[base ^ 1][j - 1][(array[i] - '0') ^ 1];
}
}
return dp[base][3][0] + dp[base][3][1];
}
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
- 20.
2万+

被折叠的 条评论
为什么被折叠?



