algorithmz 1.2.7

This is the corresponding implemenation of the python module of the same name.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

/// Remove min
///
/// Remove the smallest value from a stack, preserving the relative order of the remaining elements.
///
/// # Examples
///
/// Basic usage:
/// ```
/// let result = algorithmz::stack::remove_min(vec![]);
/// assert_eq!(result, vec![]);
/// ```
pub fn remove_min(mut stack: Vec<i32>) -> Vec<i32> {
    let mut storage_stack: Vec<i32> = Vec::new();
    if stack.len() == 0 {
        return stack;
    }
    let mut minimum = stack.pop().unwrap();
    stack.push(minimum);
    for _ in 0..stack.len() {
        let val = stack.pop().unwrap();
        if val <= minimum {
            minimum = val;
        }
        storage_stack.push(minimum);
    }
    for _ in 0..storage_stack.len() {
        let val = storage_stack.pop().unwrap();
        if val != minimum {
            stack.push(val);
        }
    }
    return stack;
}