FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/monotone-increasing-digits.py at master · Addoile/LeetCode-Solutions · GitHub
Addoile
/
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
/
monotone-increasing-digits.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
19 lines (17 loc) · 547 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
monotone-increasing-digits.py
Copy path
File metadata and controls
19 lines (17 loc) · 547 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(logn) = O(1)
# Space: O(logn) = O(1)
class
Solution
(
object
):
def
monotoneIncreasingDigits
(
self
,
N
):
"""
:type N: int
:rtype: int
"""
nums
=
map
(
int
,
list
(
str
(
N
)))
leftmost_inverted_idx
=
len
(
nums
)
for
i
in
reversed
(
xrange
(
1
,
len
(
nums
))):
if
nums
[
i
-
1
]
>
nums
[
i
]:
leftmost_inverted_idx
=
i
nums
[
i
-
1
]
-=
1
for
i
in
xrange
(
leftmost_inverted_idx
,
len
(
nums
)):
nums
[
i
]
=
9
return
int
(
""
.
join
(
map
(
str
,
nums
)))
Back
|
FazBrowse Home
|
New Git URL