-
Notifications
You must be signed in to change notification settings - Fork 0
/
s0001_two_sum.rs
33 lines (28 loc) · 842 Bytes
/
s0001_two_sum.rs
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
struct Solution;
//leetcode submit region begin(Prohibit modification and deletion)
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 (index, num) in nums.iter().enumerate() {
match map.get(&(target - num)) {
None => {
map.insert(num, index);
}
Some(sub_index) => return vec![*sub_index as i32, index as i32],
}
}
vec![]
}
}
//leetcode submit region end(Prohibit modification and deletion)
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test() {
let nums = vec![2, 7, 11, 15];
let target = 9;
assert_eq!(Solution::two_sum(nums, target), vec![0, 1]);
}
}