Welcome to Subscribe On Youtube
Formatted question description: https://leetcode.ca/all/403.html
403. Frog Jump (Hard)
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.
Given a list of stones' positions (in units) in sorted ascending order, determine if the frog is able to cross the river by landing on the last stone. Initially, the frog is on the first stone and assume the first jump must be 1 unit.
If the frog's last jump was k units, then its next jump must be either k - 1, k, or k + 1 units. Note that the frog can only jump in the forward direction.
Note:
- The number of stones is ≥ 2 and is < 1,100.
- Each stone's position will be a non-negative integer < 231.
- The first stone's position is always 0.
Example 1:
[0,1,3,5,6,8,12,17] There are a total of 8 stones. The first stone at the 0th unit, second stone at the 1st unit, third stone at the 3rd unit, and so on... The last stone at the 17th unit. Return true. The frog can jump to the last stone by jumping 1 unit to the 2nd stone, then 2 units to the 3rd stone, then 2 units to the 4th stone, then 3 units to the 6th stone, 4 units to the 7th stone, and 5 units to the 8th stone.
Example 2:
[0,1,2,3,4,8,9,11] Return false. There is no way to jump to the last stone as the gap between the 5th and 6th stone is too large.
Related Topics:
Dynamic Programming
Solution 1. DP Top-down
Let dp[i][k] be whether we can reach the end from ith stone and k is the units we jumped in the last step we get to this ith stone.
// OJ: https://leetcode.com/problems/frog-jump/
// Time: O(N^2)
// Space: O(N)
class Solution {
vector<unordered_set<int>> memo;
private:
bool dfs(vector<int> &A, int i, int k) {
if (i == A.size() - 1) return true;
if (memo[i].count(k)) return false;
int j = i + 1;
for (int d = -1; d <= 1; ++d) {
int move = k + d;
if (move <= 0) continue;
while (j < A.size() && A[j] - A[i] < move) ++j;
if (j >= A.size()) return false;
if (A[j] - A[i] == move && dfs(A, j, move)) return true;
}
memo[i].insert(k);
return false;
}
public:
bool canCross(vector<int>& A) {
memo.assign(A.size(), {});
return dfs(A, 0, 0);
}
};
-
class Solution { public boolean canCross(int[] stones) { Set<Integer> stonesSet = new HashSet<Integer>(); for (int stone : stones) stonesSet.add(stone); Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>(); int length = stones.length; Set<Integer> set0 = new HashSet<Integer>(); set0.add(0); map.put(0, set0); for (int i = 0; i < length; i++) { int curStone = stones[i]; Set<Integer> set = map.getOrDefault(curStone, new HashSet<Integer>()); for (int k : set) { int begin = Math.max(1, k - 1), end = k + 1; for (int step = begin; step <= end; step++) { int nextPosition = curStone + step; if (stonesSet.contains(nextPosition)) { Set<Integer> nextSet = map.getOrDefault(nextPosition, new HashSet<Integer>()); nextSet.add(step); map.put(nextPosition, nextSet); } } } } int lastStone = stones[length - 1]; return map.containsKey(lastStone); } } ############ class Solution { public boolean canCross(int[] stones) { int n = stones.length; boolean[][] dp = new boolean[n][n]; dp[0][0] = true; for (int i = 1; i < n; i++) { for (int j = 0; j < i; j++) { int k = stones[i] - stones[j]; if (k > j + 1) { continue; } dp[i][k] = dp[j][k - 1] || dp[j][k] || dp[j][k + 1]; if (i == n - 1 && dp[i][k]) { return true; } } } return false; } } -
// OJ: https://leetcode.com/problems/frog-jump/ // Time: O(N^2) // Space: O(N) class Solution { vector<unordered_set<int>> memo; private: bool dfs(vector<int> &A, int i, int k) { if (i == A.size() - 1) return true; if (memo[i].count(k)) return false; int j = i + 1; for (int d = -1; d <= 1; ++d) { int move = k + d; if (move <= 0) continue; while (j < A.size() && A[j] - A[i] < move) ++j; if (j >= A.size()) return false; if (A[j] - A[i] == move && dfs(A, j, move)) return true; } memo[i].insert(k); return false; } public: bool canCross(vector<int>& A) { memo.assign(A.size(), {}); return dfs(A, 0, 0); } }; -
class Solution: def canCross(self, stones: List[int]) -> bool: n = len(stones) dp = [[False] * n for i in range(n)] dp[0][0] = True for i in range(1, n): for j in range(i): k = stones[i] - stones[j] if k > j + 1: continue dp[i][k] = dp[j][k - 1] or dp[j][k] or dp[j][k + 1] if i == n - 1 and dp[i][k]: return True return False ############ class Solution(object): def canCross(self, stones): """ :type stones: List[int] :rtype: bool """ dp = {} def dfs(stones, pos, k): key = pos + k * 10000; if dp.has_key(key): return dp[key] else: for i in range(pos + 1, len(stones)): step = stones[i] - stones[pos] if step < k - 1: continue; if step > k + 1: dp[key] = False return False if dfs(stones, i, step): dp[key] = True return True dp[key] = (pos == len(stones) - 1) return (pos == len(stones) - 1) return dfs(stones, 0, 0) -
func canCross(stones []int) bool { n := len(stones) dp := make([][]bool, n) for i := 0; i < n; i++ { dp[i] = make([]bool, n) } dp[0][0] = true for i := 1; i < n; i++ { for j := 0; j < i; j++ { k := stones[i] - stones[j] // 第 j 个石子上至多只能跳出 j+1 的距离 if k > j+1 { continue } dp[i][k] = dp[j][k-1] || dp[j][k] || dp[j][k+1] if i == n-1 && dp[i][k] { return true } } } return false } -
function canCross(stones: number[]): boolean { const n = stones.length; const pos: Map<number, number> = new Map(); for (let i = 0; i < n; ++i) { pos.set(stones[i], i); } const f: number[][] = new Array(n).fill(0).map(() => new Array(n).fill(-1)); const dfs = (i: number, k: number): boolean => { if (i === n - 1) { return true; } if (f[i][k] !== -1) { return f[i][k] === 1; } for (let j = k - 1; j <= k + 1; ++j) { if (j > 0 && pos.has(stones[i] + j)) { if (dfs(pos.get(stones[i] + j)!, j)) { f[i][k] = 1; return true; } } } f[i][k] = 0; return false; }; return dfs(0, 0); }