Dynamic Programming Path

后端 未结 0 1972
北恋
北恋 2020-11-30 05:13

Given this matrix: [[4,-3,2],[6,-10,1],[10,-2,-5]]

We are in (0,0) and we need to arrive to (2,2) but there\'s only one condition: We can only move down or to the rig

相关标签:
回答
  • 消灭零回复
提交回复
热议问题