10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T4af,class Solution { public boolean findSafeWalk(List> grid, int health) { int m = grid.size(), n = grid.get(0).size(); int[][] dis = new int[m][n]; for (int[] row : dis) Arrays.fill(row, Integer.MAX_VALUE); int[][] dirs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; Deque q = new ArrayDeque<>(); q.offerFirst(new int[]{0, 0}); dis[0][0] = grid.get(0).get(0); while (!q.isEmpty()) { int[] curr = q.pollFirst(); int cx = curr[0], cy = curr[1]; if (cx == m - 1 && cy == n - 1) return true; for (int[] d : dirs) { int nx = cx + d[0], ny = cy + d[1]; if (nx >= 0 && nx < m && ny >= 0 && ny < n) { int cost = dis[cx][cy] + grid.get(nx).get(ny); if (cost >= health) continue; if (cost < dis[nx][ny]) { dis[nx][ny] = cost; if (grid.get(nx).get(ny) == 0) q.offerFirst(new int[]{nx, ny}); else q.offerLast(new int[]{nx, ny}); } } } } return false; } }13:T43f,class Solution { public: bool findSafeWalk(vector>& grid, int health) { int m = grid.size(), n = grid[0].size(); vector> dis(m, vector(n, INT_MAX)); vector> dirs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; deque> q; q.push_front({0, 0}); dis[0][0] = grid[0][0]; while (!q.empty()) { auto [cx, cy] = q.front(); q.pop_front(); if (cx == m - 1 && cy == n - 1) return true; for (auto& [dx, dy] : dirs) { int nx = cx + dx, ny = cy + dy; if (nx >= 0 && nx < m && ny >= 0 && ny < n) { int cost = dis[cx][cy] + grid[nx][ny]; if (cost >= health) continue; if (cost < dis[nx][ny]) { dis[nx][ny] = cost; if (grid[nx][ny] == 0) q.push_front({nx, ny}); else q.push_back({nx, ny}); } } } } return false; } };

Time Complexity

Space Complexity