FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/optimal-division.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
/
optimal-division.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
19 lines (17 loc) · 491 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
optimal-division.py
Copy path
File metadata and controls
19 lines (17 loc) · 491 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
18
# Time: O(n)
# Space: O(1)
class
Solution
(
object
):
def
optimalDivision
(
self
,
nums
):
"""
:type nums: List[int]
:rtype: str
"""
if
len
(
nums
)
==
1
:
return
str
(
nums
[
0
])
if
len
(
nums
)
==
2
:
return
str
(
nums
[
0
])
+
"/"
+
str
(
nums
[
1
])
result
=
[
str
(
nums
[
0
])
+
"/("
+
str
(
nums
[
1
])]
for
i
in
xrange
(
2
,
len
(
nums
)):
result
+=
"/"
+
str
(
nums
[
i
])
result
+=
")"
return
""
.
join
(
result
)
Back
|
FazBrowse Home
|
New Git URL