mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
37 lines
1.4 KiB
HTML
37 lines
1.4 KiB
HTML
<p>You are given a <strong>0-indexed</strong> binary string <code>s</code> and two integers <code>minJump</code> and <code>maxJump</code>. In the beginning, you are standing at index <code>0</code>, which is equal to <code>'0'</code>. You can move from index <code>i</code> to index <code>j</code> if the following conditions are fulfilled:</p>
|
|
|
|
<ul>
|
|
<li><code>i + minJump <= j <= min(i + maxJump, s.length - 1)</code>, and</li>
|
|
<li><code>s[j] == '0'</code>.</li>
|
|
</ul>
|
|
|
|
<p>Return <code>true</code><i> if you can reach index </i><code>s.length - 1</code><i> in </i><code>s</code><em>, or </em><code>false</code><em> otherwise.</em></p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "<u>0</u>11<u>0</u>1<u>0</u>", minJump = 2, maxJump = 3
|
|
<strong>Output:</strong> true
|
|
<strong>Explanation:</strong>
|
|
In the first step, move from index 0 to index 3.
|
|
In the second step, move from index 3 to index 5.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "01101110", minJump = 2, maxJump = 3
|
|
<strong>Output:</strong> false
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= s.length <= 10<sup>5</sup></code></li>
|
|
<li><code>s[i]</code> is either <code>'0'</code> or <code>'1'</code>.</li>
|
|
<li><code>s[0] == '0'</code></li>
|
|
<li><code>1 <= minJump <= maxJump < s.length</code></li>
|
|
</ul>
|