FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/unique-paths.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
/
unique-paths.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
16 lines (12 loc) · 337 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
unique-paths.py
Copy path
File metadata and controls
16 lines (12 loc) · 337 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
# Time: O(m * n)
# Space: O(m + n)
class
Solution
(
object
):
# @return an integer
def
uniquePaths
(
self
,
m
,
n
):
if
m
<
n
:
return
self
.
uniquePaths
(
n
,
m
)
ways
=
[
1
]
*
n
for
i
in
xrange
(
1
,
m
):
for
j
in
xrange
(
1
,
n
):
ways
[
j
]
+=
ways
[
j
-
1
]
return
ways
[
n
-
1
]
Back
|
FazBrowse Home
|
New Git URL