two_sum.rs

two_sum.rs

use std::collections::HashMap;

impl Solution {
    pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
        let mut map = HashMap::with_capacity(nums.len());
        for (i, n) in nums.iter().copied().enumerate() {
            let i = i as i32;
            let r = target - n;
            if let Some(j) = map.get(&r) {
                let j = *j;
                return vec![i, j];
            } else {
                map.insert(n, i);
            }
        }
        panic!("no solution")
    }
}