Skip to content

Commit 2d13916

Browse files
klever34idoocs
authored andcommitted
style: format code and docs with prettier
1 parent e54106b commit 2d13916

File tree

1 file changed

+2
-2
lines changed
  • lcof/面试题47. 礼物的最大价值

1 file changed

+2
-2
lines changed

lcof/面试题47. 礼物的最大价值/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -206,13 +206,13 @@ class Solution {
206206
let m = grid.count
207207
let n = grid[0].count
208208
var f = [[Int]](repeating: [Int](repeating: 0, count: n + 1), count: m + 1)
209-
209+
210210
for i in 1...m {
211211
for j in 1...n {
212212
f[i][j] = max(f[i - 1][j], f[i][j - 1]) + grid[i - 1][j - 1]
213213
}
214214
}
215-
215+
216216
return f[m][n]
217217
}
218218
}

0 commit comments

Comments
 (0)