Greedy Algorithms - Jump Game II (Minimum Jumps)
Examine the following greedy code snippet for Jump Game II. Which line contains a subtle bug that can cause incorrect jump counts on some inputs?
```python
def jump(nums):
jumps = 0
current_end = 0
furthest = 0
for i in range(len(nums)):
furthest = max(furthest, i + nums[i])
if i == current_end:
jumps += 1
# Missing update of current_end here
return jumps
```