Question

How to find the smallest missing number from sorted list in Rust

Answer 1

#![allow(non_snake_case)]

fn findSmallestMissingNumber(arr : [isize; 8]) -> isize {
    let mut min : isize = arr[0];
    let size : usize = arr.len();
    {
        let mut i : usize  = 1;
        while i < size {
            if arr[i as usize] > min + 1 {
                return min + 1;
            }
            else {
                min = arr[i as usize];
            }
            i += 1;
        }
    }
    
    return -1;
}
    
fn main() {
    let arr: [isize; 8] = [18, 19, 20, 27, 33, 36, 40, 42];
    
    print!("{}", findSmallestMissingNumber(arr));
}




/*
run:

21

*/

 

70+ SQL courses for beginners and professionals