A frog is trying to cross a river by jumping on stones placed at various positions along the river. The river is divided into units, and some units contain stones while others do not. The frog can only land on a stone, but it must not jump into the water.

You are given an array, stones, that represents the positions of the stones in ascending order (in units). The frog starts on the first stone, and its first jump must be exactly $1$ unit.

If the frog’s last jump was of length $k$ units, its next jump must be either $k-1$, $k$, or $k+1$ units. The frog can only move forward.

Your task is to determine whether the frog can successfully reach the last stone.

Constraints:

• $2 \leq$ ...