DP思想,只要某位置可以到达能到达终点的位置,则该位置可达终点。
class Solution {
public:
bool canReach(string& s, int minJump, int maxJump) {
int len = s.size();
if (s[len - 1] == '0') { // 题意不保证
positions.push_back(len - 1);
} else {
return false;
}
bool res(false);
for (int i = len - 2; i >= 0; --i) {
res = check(s, i, minJump, maxJump);
}
return res;
}
private:
vector<int> positions; // 按照从后到前的顺序储存有效的位数
// 检查第i位是否是可达终点
bool check(string& s, int i, int minJump, int maxJump) {
if (s[i] != '0') {
return false;
}
int len = positions.size();
for (int j = len - 1; j >= 0; --j) {
int leftWall = i + minJump; // 遵题意
int rightWall = min(i + maxJump, static_cast<int>(s.size()) - 1); // 遵题意
if (positions[j] > rightWall) {
break;
} else if ((positions[j] <= rightWall) && (leftWall <= positions[j])) {
positions.push_back(i);
return true;
}
}
return false;
}
};