FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/minimum-path-sum.py at master · pythonpeixun/LeetCode-Solutions · GitHub
pythonpeixun
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
Python
/
minimum-path-sum.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
18 lines (14 loc) · 486 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
minimum-path-sum.py
Copy path
File metadata and controls
18 lines (14 loc) · 486 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
# Time: O(m * n)
# Space: O(m + n)
class
Solution
(
object
):
# @param grid, a list of lists of integers
# @return an integer
def
minPathSum
(
self
,
grid
):
sum
=
list
(
grid
[
0
])
for
j
in
xrange
(
1
,
len
(
grid
[
0
])):
sum
[
j
]
=
sum
[
j
-
1
]
+
grid
[
0
][
j
]
for
i
in
xrange
(
1
,
len
(
grid
)):
sum
[
0
]
+=
grid
[
i
][
0
]
for
j
in
xrange
(
1
,
len
(
grid
[
0
])):
sum
[
j
]
=
min
(
sum
[
j
-
1
],
sum
[
j
])
+
grid
[
i
][
j
]
return
sum
[
-
1
]
Back
|
FazBrowse Home
|
New Git URL