@@ -0,0 +1,1608 @@
+%22%22%22Leetcode 403. Frog Jump%0AHard%0A%0AURL: https://leetcode.com/problems/frog-jump/%0A%0AA frog is crossing a river. The river is divided into x units and at each unit%0Athere may or may not exist a stone. The frog can jump on a stone, but it must%0Anot jump into the water.%0A%0AGiven a list of stones' positions (in units) in sorted ascending order, determine%0Aif the frog is able to cross the river by landing on the last stone. Initially,%0Athe frog is on the first stone and assume the first jump must be 1 unit.%0A%0AIf the frog's last jump was k units, then its next jump must be either%0Ak - 1, k, or k + 1 units. Note that the frog can only jump in the forward direction.%0A%0ANote:%0A- The number of stones is %3E= 2 and is %3C 1,100.%0A- Each stone's position will be a non-negative integer %3C 231.%0A- The first stone's position is always 0.%0A%0AExample 1:%0A%5B0,1,3,5,6,8,12,17%5D%0AThere are a total of 8 stones.%0AThe first stone at the 0th unit, second stone at the 1st unit,%0Athird stone at the 3rd unit, and so on...%0AThe last stone at the 17th unit.%0AReturn true. The frog can jump to the last stone by jumping %0A1 unit to the 2nd stone, then 2 units to the 3rd stone, then %0A2 units to the 4th stone, then 3 units to the 6th stone, %0A4 units to the 7th stone, and 5 units to the 8th stone.%0A%0AExample 2:%0A%5B0,1,2,3,4,8,9,11%5D%0AReturn false. There is no way to jump to the last stone as %0Athe gap between the 5th and 6th stone is too large.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def canCross(self, stones):%0A        %22%22%22%0A        :type stones: List%5Bint%5D%0A        :rtype: bool%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0403_frog_jump.py