Package g1801_1900.s1871_jump_game_vii

Class Solution

  • public class Solution
extends Object
    1871 - Jump Game VII\. Medium You are given a **0-indexed** binary string `s` and two integers `minJump` and `maxJump`. In the beginning, you are standing at index `0`, which is equal to `'0'`. You can move from index `i` to index `j` if the following conditions are fulfilled: * `i + minJump <= j <= min(i + maxJump, s.length - 1)`, and * `s[j] == '0'`. Return `true` _if you can reach index_ `s.length - 1` _in_ `s`_, or_ `false` _otherwise._ **Example 1:** **Input:** s = "011010", minJump = 2, maxJump = 3 **Output:** true **Explanation:** In the first step, move from index 0 to index 3. In the second step, move from index 3 to index 5. **Example 2:** **Input:** s = "01101110", minJump = 2, maxJump = 3 **Output:** false **Constraints:** * 2 <= s.length <= 105 * `s[i]` is either `'0'` or `'1'`. * `s[0] == '0'` * `1 <= minJump <= maxJump < s.length`

    • Constructor Detail

      • Solution

        public Solution()

    • Method Detail

      • canReach

        public boolean canReach​(String s,
                        int minJump,
                        int maxJump)