Update .gitignore

Add build script for Zig.

codes/zig/chapter_computational_complexity/leetcode_two_sum.zig

@@ -6,43 +6,40 @@ const std = @import("std");
 const inc = @import("include");
 
 // 方法一：暴力枚举
-const SolutionBruteForce = struct {
-    pub fn twoSum(self: *SolutionBruteForce, nums: []i32, target: i32) [2]i32 {
-        _ = self;
-        var size: usize = nums.len;
-        var i: usize = 0;
-        // 两层循环，时间复杂度 O(n^2)
-        while (i < size - 1) : (i += 1) {
-            var j = i + 1;
-            while (j < size) : (j += 1) {
-                if (nums[i] + nums[j] == target) {
-                    return [_]i32{@intCast(i32, i), @intCast(i32, j)};
-                }
+pub fn twoSumBruteForce(nums: []i32, target: i32) [2]i32 {
+    _ = self;
+    var size: usize = nums.len;
+    var i: usize = 0;
+    // 两层循环，时间复杂度 O(n^2)
+    while (i < size - 1) : (i += 1) {
+        var j = i + 1;
+        while (j < size) : (j += 1) {
+            if (nums[i] + nums[j] == target) {
+                return [_]i32{@intCast(i32, i), @intCast(i32, j)};
             }
         }
-        return undefined;
     }
-};
+    return undefined;
+}
 
 // 方法二：辅助哈希表
-const SolutionHashMap = struct {
-    pub fn twoSum(self: *SolutionHashMap, nums: []i32, target: i32) ![2]i32 {
-        _ = self;
-        var size: usize = nums.len;
-        // 辅助哈希表，空间复杂度 O(n)
-        var dic = std.AutoHashMap(i32, i32).init(std.heap.page_allocator);
-        defer dic.deinit();
-        var i: usize = 0;
-        // 单层循环，时间复杂度 O(n)
-        while (i < size) : (i += 1) {
-            if (dic.contains(target - nums[i])) {
-                return [_]i32{dic.get(target - nums[i]).?, @intCast(i32, i)};
-            }
-            try dic.put(nums[i], @intCast(i32, i));
+pub fn twoSumHashTable(nums: []i32, target: i32) ![2]i32 {
+    _ = self;
+    var size: usize = nums.len;
+    // 辅助哈希表，空间复杂度 O(n)
+    var dic = std.AutoHashMap(i32, i32).init(std.heap.page_allocator);
+    defer dic.deinit();
+    var i: usize = 0;
+    // 单层循环，时间复杂度 O(n)
+    while (i < size) : (i += 1) {
+        if (dic.contains(target - nums[i])) {
+            return [_]i32{dic.get(target - nums[i]).?, @intCast(i32, i)};
         }
-        return undefined;
+        try dic.put(nums[i], @intCast(i32, i));
     }
-};
+    return undefined;
+}
+
 
 // Driver Code
 pub fn main() !void {
@@ -50,14 +47,11 @@ pub fn main() !void {
     var nums = [_]i32{ 2, 7, 11, 15 };
     var target: i32 = 9;
     // 方法一
-    var slt1 = SolutionBruteForce{};
-    var res = slt1.twoSum(&nums, target);
+    twoSumBruteForce(&nums, target);
     std.debug.print("方法一 res = ", .{});
     inc.PrintUtil.printArray(i32, &res); 
     // 方法二
-    var slt2 = SolutionHashMap{};
-    res = try slt2.twoSum(&nums, target);
+    twoSumHashTable(&nums, target);
     std.debug.print("方法二 res = ", .{});
     inc.PrintUtil.printArray(i32, &res); 
 }
-

codes/zig/chapter_computational_complexity/time_complexity.zig

@@ -72,7 +72,7 @@ fn bubbleSort(nums: []i32) i32 {
 }
 
 // 指数阶（循环实现）
-fn exponential(n: i32) i32{
+fn exponential(n: i32) i32 {
     var count: i32 = 0;
     var bas: i32 = 1;
     var i: i32 = 0;
@@ -89,14 +89,13 @@ fn exponential(n: i32) i32{
 }
 
 // 指数阶（递归实现）
-fn expRecur(n: i32) i32{
+fn expRecur(n: i32) i32 {
     if (n == 1) return 1;
     return expRecur(n - 1) + expRecur(n - 1) + 1;
 }
 
 // 对数阶（循环实现）
-fn logarithmic(n: f32) i32
-{
+fn logarithmic(n: f32) i32 {
     var count: i32 = 0;
     var n_var = n;
     while (n_var > 1)
@@ -108,15 +107,13 @@ fn logarithmic(n: f32) i32
 }
 
 // 对数阶（递归实现）
-fn logRecur(n: f32) i32
-{
+fn logRecur(n: f32) i32 {
     if (n <= 1) return 0;
     return logRecur(n / 2) + 1;
 }
 
 // 线性对数阶
-fn linearLogRecur(n: f32) i32
-{
+fn linearLogRecur(n: f32) i32 {
     if (n <= 1) return 1;
     var count: i32 = linearLogRecur(n / 2) +
                 linearLogRecur(n / 2);