mirror of
https://github.com/krahets/hello-algo.git
synced 2025-10-31 10:26:48 +08:00
2a9db6d039
* Sync zh and zh-hant versions. * Remove the polyfill.io link from mkdocs.yml * Update contributors' info for code reviewers and en/zh-hant versions reviewers. * Fix graph.md * Update avatars for English version reviewers. * Sync zh and zh-hant versions. * Fix two_sum_brute_force.png * Sync zh and zh-hant versions. Optimize structrue of index.html. * Format index.html
53 lines
1.5 KiB
Rust
53 lines
1.5 KiB
Rust
/*
|
|
* File: two_sum.rs
|
|
* Created Time: 2023-01-14
|
|
* Author: xBLACICEx (xBLACKICEx@outlook.com), codingonion (coderonion@gmail.com)
|
|
*/
|
|
|
|
use hello_algo_rust::include::print_util;
|
|
use std::collections::HashMap;
|
|
|
|
/* 方法一：暴力列舉 */
|
|
pub fn two_sum_brute_force(nums: &Vec<i32>, target: i32) -> Option<Vec<i32>> {
|
|
let size = nums.len();
|
|
// 兩層迴圈，時間複雜度為 O(n^2)
|
|
for i in 0..size - 1 {
|
|
for j in i + 1..size {
|
|
if nums[i] + nums[j] == target {
|
|
return Some(vec![i as i32, j as i32]);
|
|
}
|
|
}
|
|
}
|
|
None
|
|
}
|
|
|
|
/* 方法二：輔助雜湊表 */
|
|
pub fn two_sum_hash_table(nums: &Vec<i32>, target: i32) -> Option<Vec<i32>> {
|
|
// 輔助雜湊表，空間複雜度為 O(n)
|
|
let mut dic = HashMap::new();
|
|
// 單層迴圈，時間複雜度為 O(n)
|
|
for (i, num) in nums.iter().enumerate() {
|
|
match dic.get(&(target - num)) {
|
|
Some(v) => return Some(vec![*v as i32, i as i32]),
|
|
None => dic.insert(num, i as i32),
|
|
};
|
|
}
|
|
None
|
|
}
|
|
|
|
fn main() {
|
|
// ======= Test Case =======
|
|
let nums = vec![2, 7, 11, 15];
|
|
let target = 13;
|
|
|
|
// ====== Driver Code ======
|
|
// 方法一
|
|
let res = two_sum_brute_force(&nums, target).unwrap();
|
|
print!("方法一 res = ");
|
|
print_util::print_array(&res);
|
|
// 方法二
|
|
let res = two_sum_hash_table(&nums, target).unwrap();
|
|
print!("\n方法二 res = ");
|
|
print_util::print_array(&res);
|
|
}
|