algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update the coding style for Rust and Zig (#356)

Browse Source 
Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
sjinzh
2023-02-09 23:07:43 +08:00
committed by GitHub
parent ec25970e8e
commit 08b7474894
2 changed files with 30 additions and 37 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
codes/zig/chapter_computational_complexity/leetcode_two_sum.zig
View File

@@ -6,8 +6,7 @@ const std = @import("std");
const inc = @import("include");
// 方法一：暴力枚举
pub fn twoSumBruteForce(nums: []i32, target: i32) [2]i32 {
_ = self;
pub fn twoSumBruteForce(nums: []i32, target: i32) ?[2]i32 {
var size: usize = nums.len;
var i: usize = 0;
// 两层循环，时间复杂度 O(n^2)
@@ -19,12 +18,11 @@ pub fn twoSumBruteForce(nums: []i32, target: i32) [2]i32 {
}
}
}
return undefined;
return null;
}
// 方法二：辅助哈希表
pub fn twoSumHashTable(nums: []i32, target: i32) ![2]i32 {
_ = self;
pub fn twoSumHashTable(nums: []i32, target: i32) !?[2]i32 {
var size: usize = nums.len;
// 辅助哈希表，空间复杂度 O(n)
var dic = std.AutoHashMap(i32, i32).init(std.heap.page_allocator);
@@ -37,21 +35,22 @@ pub fn twoSumHashTable(nums: []i32, target: i32) ![2]i32 {
}
try dic.put(nums[i], @intCast(i32, i));
}
return undefined;
return null;
}
// Driver Code
pub fn main() !void {
// ======= Test Case =======
var nums = [_]i32{ 2, 7, 11, 15 };
var target: i32 = 9;
// ====== Driver Code ======
// 方法一
twoSumBruteForce(&nums, target);
var res = twoSumBruteForce(&nums, target).?;
std.debug.print("方法一 res = ", .{});
inc.PrintUtil.printArray(i32, &res);
// 方法二
twoSumHashTable(&nums, target);
std.debug.print("方法二 res = ", .{});
res = (try twoSumHashTable(&nums, target)).?;
std.debug.print("\n方法二 res = ", .{});
inc.PrintUtil.printArray(i32, &res);
}