Please solve the programming task below using a self-contained code snippet in a markdown code block.

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.
 
Please complete the following python code precisely:
```python
class Solution:
    def canReach(self, s: str, minJump: int, maxJump: int) -> bool:
```