xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-09-01 12:47:14 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-02-09 23:12:58 +08:00
parent 7d86e2dd11
commit 49d39ff871
1 changed files with 4 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_computational_complexity/space_time_tradeoff.md
+4 -6
View File
@@ -178,8 +178,7 @@ comments: true
```zig title="leetcode_two_sum.zig" ```zig title="leetcode_two_sum.zig"
// 方法一：暴力枚举 // 方法一：暴力枚举
fn twoSumBruteForce(nums: []i32, target: i32) [2]i32 { fn twoSumBruteForce(nums: []i32, target: i32) ?[2]i32 {
_ = self;
var size: usize = nums.len; var size: usize = nums.len;
var i: usize = 0; var i: usize = 0;
// 两层循环，时间复杂度 O(n^2) // 两层循环，时间复杂度 O(n^2)
@@ -191,7 +190,7 @@ comments: true
} }
} }
} }
return undefined; return null;
} }
``` ```
@@ -361,8 +360,7 @@ comments: true
```zig title="leetcode_two_sum.zig" ```zig title="leetcode_two_sum.zig"
// 方法二：辅助哈希表 // 方法二：辅助哈希表
fn twoSumHashTable(nums: []i32, target: i32) ![2]i32 { fn twoSumHashTable(nums: []i32, target: i32) !?[2]i32 {
_ = self;
var size: usize = nums.len; var size: usize = nums.len;
// 辅助哈希表，空间复杂度 O(n) // 辅助哈希表，空间复杂度 O(n)
var dic = std.AutoHashMap(i32, i32).init(std.heap.page_allocator); var dic = std.AutoHashMap(i32, i32).init(std.heap.page_allocator);
@@ -375,6 +373,6 @@ comments: true
} }
try dic.put(nums[i], @intCast(i32, i)); try dic.put(nums[i], @intCast(i32, i));
} }
return undefined; return null;
} }
``` ```