mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 11:34:46 +08:00
Merge pull request #227 from LiangDazhu/patch-15
添加 0738.单调递增的数字python版本
This commit is contained in:
@ -8,6 +8,7 @@
|
||||
|
||||
|
||||
## 738.单调递增的数字
|
||||
题目链接: https://leetcode-cn.com/problems/monotone-increasing-digits/
|
||||
|
||||
给定一个非负整数 N,找出小于或等于 N 的最大的整数,同时这个整数需要满足其各个位数上的数字是单调递增。
|
||||
|
||||
@ -30,7 +31,7 @@
|
||||
|
||||
## 暴力解法
|
||||
|
||||
题意很简单,那么首先想的就是暴力解法了,来我提大家暴力一波,结果自然是超时!
|
||||
题意很简单,那么首先想的就是暴力解法了,来我替大家暴力一波,结果自然是超时!
|
||||
|
||||
代码如下:
|
||||
```C++
|
||||
@ -146,7 +147,19 @@ class Solution {
|
||||
|
||||
|
||||
Python:
|
||||
|
||||
```python
|
||||
class Solution:
|
||||
def monotoneIncreasingDigits(self, n: int) -> int:
|
||||
strNum = list(str(n))
|
||||
flag = len(strNum)
|
||||
for i in range(len(strNum) - 1, 0, -1):
|
||||
if int(strNum[i]) < int(strNum[i - 1]):
|
||||
strNum[i - 1] = str(int(strNum[i - 1]) - 1)
|
||||
flag = i
|
||||
for i in range(flag, len(strNum)):
|
||||
strNum[i] = '9'
|
||||
return int("".join(strNum))
|
||||
```
|
||||
|
||||
Go:
|
||||
|
||||
|
Reference in New Issue
Block a user