li_chx
/
rust_test
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

1526. 形成目标数组的子数组最少增加次数

This commit is contained in:
li-chx 2025-10-30 17:12:52 +08:00
parent b8cc12db71
commit 8a581be8b5
1 changed files with 3 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/main.rs
View File

@ -2,14 +2,11 @@ mod arr;
struct Solution {}
impl Solution {
pub fn next_beautiful_number(n: i32) -> i32 {
let arr = vec![ 0,1,22,122,212,221,333,1333,3133,3313,3331,4444,14444,22333,23233,23323,23332,32233,32323,32332,33223,33232,33322,41444,44144,44414,44441,55555,122333,123233,123323,123332,132233,132323,132332,133223,133232,133322,155555,212333,213233,213323,213332,221333,223133,223313,223331,224444,231233,231323,231332,232133,232313,232331,233123,233132,233213,233231,233312,233321,242444,244244,244424,244442,312233,312323,312332,313223,313232,313322,321233,321323,321332,322133,322313,322331,323123,323132,323213,323231,323312,323321,331223,331232,331322,332123,332132,332213,332231,332312,332321,333122,333212,333221,422444,424244,424424,424442,442244,442424,442442,444224,444242,444422,515555,551555,555155,555515,555551,666666,1224444 ];
let point = arr.partition_point(|v| v <= &n);
arr[point]
pub fn min_number_operations(target: Vec<i32>) -> i32 {
target[0] + target.windows(2).map(|x| (x[1] - x[0]).max(0)).sum::<i32>()
}
}
fn main() {
println!("{:?}", Solution::next_beautiful_number(1333));
println!("{:?}", Solution::min_number_operations(vec![3,1,5,4,2]));
}