leetcode-3603-minimum-cost-path-with-alternating-directions-ii

leetcode-3603-minimum-cost-path-with-alternating-directions-ii

https://leetcode.com/problems/minimum-cost-path-with-alternating-directions-ii

Type: Classic

Run Code Result

Your input

1
2
[[1,2]]
2
2
[[3,5],[2,4]]
2
3
[[6,1,4],[3,2,5]]

Your stdout

Your answer

3
9
16