Skip to content

Commit c271a9f

Browse files
committed
feat: update python solution and modify README file
1 parent e616ae4 commit c271a9f

File tree

3 files changed

+2
-4
lines changed

3 files changed

+2
-4
lines changed

README_CN.md

+2
Original file line numberDiff line numberDiff line change
@@ -25,6 +25,8 @@
2525
- [程序员面试金典(第 6 版)](./lcci/README.md)
2626

2727
## 参与项目
28+
刷编程题的最大好处就是**可以锻炼解决问题的思维能力**。相信我,「如何去思考」​本身也是一项需要不断学习和练习的技能。非常感谢前微软工程师、现蚂蚁金服技术专家 [@kfstorm](https://github.com/kfstorm) 贡献了本项目的所有 [C# 题解](https://github.com/doocs/leetcode/pull/245)
29+
2830
如果你对本项目感兴趣,并且希望加入我们刷题大军,欢迎随时提交 [PR](https://github.com/doocs/leetcode/pulls)。请参考如下步骤:
2931

3032
-[本项目](https://github.com/doocs/leetcode) <kbd>Fork</kbd> 到你的个人 GitHub 帐户,然后 <kbd>clone</kbd> 到你的本地机器;

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

-2
Original file line numberDiff line numberDiff line change
@@ -27,8 +27,6 @@
2727
class Solution:
2828
def maxValue(self, grid: List[List[int]]) -> int:
2929
rows, cols = len(grid), len(grid[0])
30-
if rows == 0 or cols == 0:
31-
return 0
3230
vals = [[0 for _ in range(cols)] for _ in range(rows)]
3331
vals[0][0] = grid[0][0]
3432
for i in range(1, rows):

lcof/面试题47. 礼物的最大价值/Solution.py

-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,6 @@
11
class Solution:
22
def maxValue(self, grid: List[List[int]]) -> int:
33
rows, cols = len(grid), len(grid[0])
4-
if rows == 0 or cols == 0:
5-
return 0
64
vals = [[0 for _ in range(cols)] for _ in range(rows)]
75
vals[0][0] = grid[0][0]
86
for i in range(1, rows):

0 commit comments

Comments
 (0)