Help me In this question : Find number of paths from source to destination?

Правка en2, от EmilyBloom, 2022-06-25 09:22:15

Hi. I recently came accross this question. Link

Given a 2d array where 1 represent a stone and 0 represent water. Return how many path exist in the matrix from top row to the bottom row. You can travel in all directions (top, bottom, left, right) by one position.

Input: [[0, 1, 0, 1, 1],

[0, 1, 1, 0, 1],

[0, 0, 1, 1, 0],

[0, 0, 0, 1, 1]]

The first obvious thought that comes to my mind is backtracking, but that will have large time complexity. How to do this?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский EmilyBloom 2022-06-25 09:22:31 10 Tiny change: 'to do this?\n\n' -> 'to do this optimally?\n\n'
en2 Английский EmilyBloom 2022-06-25 09:22:15 6
en1 Английский EmilyBloom 2022-06-25 09:21:53 661 Initial revision (published)