rustgym 0.2.0

rustgym solutions
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

struct Solution;

use std::i32;

impl Solution {
    fn three_sum_closest(mut nums: Vec<i32>, target: i32) -> i32 {
        nums.sort_unstable();
        let n = nums.len();
        let mut res = 0;
        let mut diff = i32::MAX;
        for i in 0..n - 2 {
            let mut l = i + 1;
            let mut r = n - 1;
            while l < r {
                let sum = nums[l] + nums[r] + nums[i];
                if sum == target {
                    return target;
                }
                if (sum - target).abs() < diff {
                    diff = (sum - target).abs();
                    res = sum;
                }
                if nums[l] + nums[r] > target - nums[i] {
                    r -= 1;
                } else {
                    l += 1;
                }
            }
        }
        res
    }
}

#[test]
fn test() {
    let nums = vec![-1, 2, 1, -4];
    let target = 1;
    let res = 2;
    assert_eq!(Solution::three_sum_closest(nums, target), res);
}