We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent ab4a25a commit 7f7c9b7Copy full SHA for 7f7c9b7
kotlin/0064-minimum-path-sum.kt
@@ -0,0 +1,22 @@
1
+class Solution {
2
+ fun minPathSum(grid: Array<IntArray>): Int {
3
+ val m = grid.lastIndex
4
+ val n = grid[0].lastIndex
5
+
6
+ for(i in m - 1 downTo 0) {
7
+ grid[i][n] += grid[i + 1][n]
8
+ }
9
10
+ for(j in n - 1 downTo 0) {
11
+ grid[m][j] += grid[m][j + 1]
12
13
14
+ for(i in grid.lastIndex - 1 downTo 0) {
15
+ for(j in grid[0].lastIndex - 1 downTo 0) {
16
+ grid[i][j] += minOf(grid[i + 1][j], grid[i][j + 1])
17
18
19
20
+ return grid[0][0]
21
22
+}
0 commit comments