leetcode-rust 0.1.2

Some solutions about leetcode in rust lang
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109

#![allow(dead_code)]

pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
    if n == 0 {
        return;
    }
    if m == 0 {
        for (i, num) in nums2.iter().enumerate() {
            nums1[i] = *num;
        }
        return;
    }

    let m = m as usize;
    let n = n as usize;
    // move n position distances
    for i in (0..m).rev() {
        nums1[i + n] = nums1[i];
    }
    let mut count = 0;
    let mut i = n;
    let mut j = 0;

    while i != m + n && j != n {
        if nums1[i] < nums2[j] {
            nums1[count] = nums1[i];
            i += 1;
        } else {
            nums1[count] = nums2[j];
            j += 1;
        }
        count += 1;
    }

    while i != m + n {
        nums1[count] = nums1[i];
        i += 1;
        count += 1;
    }

    while j != n {
        nums1[count] = nums2[j];
        j += 1;
        count += 1;
    }
}

// insert larger number to tail
pub fn merge2(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
    if n == 0 {
        return;
    }
    if m == 0 {
        for (i, num) in nums2.iter().enumerate() {
            nums1[i] = *num;
        }
        return;
    }
    let mut k = m + n - 1;
    let mut i = m - 1;
    let mut j = n - 1;
    // guard
    while k >= 0 {
        if (j < 0 && i >= 0) || (i >= 0 && nums1[i as usize] > nums2[j as usize]) {
            nums1[k as usize] = nums1[i as usize];
            i -= 1;
            k -= 1;
        } else if (i < 0 && j >= 0) || (j >= 0 && nums1[i as usize] <= nums2[j as usize]) {
            nums1[k as usize] = nums2[j as usize];
            j -= 1;
            k -= 1;
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test1() {
        let mut nums1 = vec![1, 2, 3, 0, 0, 0];
        let mut nums2 = vec![2, 5, 6];
        let nums3 = vec![1, 2, 2, 3, 5, 6];
        merge(&mut nums1, 3, &mut nums2, 3);
        assert_eq!(nums1, nums3);

        let mut nums1 = vec![1, 2, 4, 5, 6, 0];
        let mut nums2 = vec![3];
        let nums3 = vec![1, 2, 3, 4, 5, 6];
        merge(&mut nums1, 5, &mut nums2, 1);
        assert_eq!(nums1, nums3);
    }

    #[test]
    fn test2() {
        let mut nums1 = vec![1, 2, 3, 0, 0, 0];
        let mut nums2 = vec![2, 5, 6];
        let nums3 = vec![1, 2, 2, 3, 5, 6];
        merge(&mut nums1, 3, &mut nums2, 3);
        assert_eq!(nums1, nums3);

        let mut nums1 = vec![1, 2, 4, 5, 6, 0];
        let mut nums2 = vec![3];
        let nums3 = vec![1, 2, 3, 4, 5, 6];
        merge2(&mut nums1, 5, &mut nums2, 1);
        assert_eq!(nums1, nums3);
    }
}