How to solve DP 4
1 min readDec 6, 2019
931. Minimum Falling Path Sum
This problem can use the TCP-DP and NCtoDP strategy to solve. The link of this strategy is here:
Code is here:
There are too many similar problems. And I will keep on updating this post by adding more examples.