algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0738.单调递增的数字.md

Browse Source
This commit is contained in:
fw_qaq
2023-04-01 12:22:37 +08:00
committed by GitHub
parent eb866901a2
commit cd1a680c26
1 changed files with 10 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
problems/0738.单调递增的数字.md
View File

@ -280,18 +280,20 @@ object Solution {
```Rust ```Rust
impl Solution { impl Solution {
pub fn monotone_increasing_digits(n: i32) -> i32 { pub fn monotone_increasing_digits(n: i32) -> i32 {
let mut str_num = n.to_string().chars().map(|x| x.to_digit(10).unwrap() as i32).collect::<Vec<i32>>(); let mut n_bytes = n.to_string().into_bytes();
let mut flag = str_num.len(); let mut flag = n_bytes.len();
for i in (1..str_num.len()).rev() { for i in (1..n_bytes.len()).rev() {
if str_num[i - 1] > str_num[i] { if n_bytes[i - 1] > n_bytes[i] {
flag = i; flag = i;
str_num[i - 1] -= 1; n_bytes[i - 1] -= 1;
} }
} }
for i in flag..str_num.len() { for v in n_bytes.iter_mut().skip(flag) {
str_num[i] = 9; *v = 57;
} }
str_num.iter().fold(0, |acc, x| acc * 10 + x) n_bytes
.into_iter()
.fold(0, |acc, x| acc * 10 + x as i32 - 48)
} }
} }
``` ```