code: update zig 0.14.1 for the chapter of array_and_linkedlist and computational_complexity (#1787)

* update zig array list chapter

* update not need change codes.

* fix some pr issues and update time space chapter

codes/zig/chapter_computational_complexity/iteration.zig

@@ -1,6 +1,6 @@
 // File: iteration.zig
 // Created Time: 2023-09-27
-// Author: QiLOL (pikaqqpika@gmail.com)
+// Author: QiLOL (pikaqqpika@gmail.com), CreatorMetaSky (creator_meta_sky@163.com)
 
 const std = @import("std");
 const Allocator = std.mem.Allocator;
@@ -9,20 +9,19 @@ const Allocator = std.mem.Allocator;
 fn forLoop(n: usize) i32 {
     var res: i32 = 0;
     // 循环求和 1, 2, ..., n-1, n
-    for (1..n+1) |i| {
-        res = res + @as(i32, @intCast(i));
+    for (1..n + 1) |i| {
+        res += @intCast(i);
     }
     return res;
-} 
+}
 
 // while 循环
 fn whileLoop(n: i32) i32 {
     var res: i32 = 0;
     var i: i32 = 1; // 初始化条件变量
     // 循环求和 1, 2, ..., n-1, n
-    while (i <= n) {
+    while (i <= n) : (i += 1) {
         res += @intCast(i);
-        i += 1;
     }
     return res;
 }
@@ -32,11 +31,12 @@ fn whileLoopII(n: i32) i32 {
     var res: i32 = 0;
     var i: i32 = 1; // 初始化条件变量
     // 循环求和 1, 4, 10, ...
-    while (i <= n) {
-        res += @intCast(i);
+    while (i <= n) : ({
         // 更新条件变量
         i += 1;
         i *= 2;
+    }) {
+        res += @intCast(i);
     }
     return res;
 }
@@ -47,31 +47,45 @@ fn nestedForLoop(allocator: Allocator, n: usize) ![]const u8 {
     defer res.deinit();
     var buffer: [20]u8 = undefined;
     // 循环 i = 1, 2, ..., n-1, n
-    for (1..n+1) |i| {
+    for (1..n + 1) |i| {
         // 循环 j = 1, 2, ..., n-1, n
-        for (1..n+1) |j| {
-            var _str = try std.fmt.bufPrint(&buffer, "({d}, {d}), ", .{i, j});
-            try res.appendSlice(_str);
+        for (1..n + 1) |j| {
+            const str = try std.fmt.bufPrint(&buffer, "({d}, {d}), ", .{ i, j });
+            try res.appendSlice(str);
         }
     }
     return res.toOwnedSlice();
 }
 
 // Driver Code
-pub fn main() !void {
+pub fn run() !void {
+    var gpa = std.heap.DebugAllocator(.{}){};
+    defer _ = gpa.deinit();
+    const allocator = gpa.allocator();
+
     const n: i32 = 5;
     var res: i32 = 0;
 
     res = forLoop(n);
-    std.debug.print("\nfor 循环的求和结果 res = {}\n", .{res});
+    std.debug.print("for 循环的求和结果 res = {}\n", .{res});
 
     res = whileLoop(n);
-    std.debug.print("\nwhile 循环的求和结果 res = {}\n", .{res});
+    std.debug.print("while 循环的求和结果 res = {}\n", .{res});
 
     res = whileLoopII(n);
-    std.debug.print("\nwhile 循环（两次更新）求和结果 res = {}\n", .{res});
+    std.debug.print("while 循环（两次更新）求和结果 res = {}\n", .{res});
 
-    const allocator = std.heap.page_allocator;
     const resStr = try nestedForLoop(allocator, n);
-    std.debug.print("\n双层 for 循环的遍历结果 {s}\n", .{resStr});
+    std.debug.print("双层 for 循环的遍历结果 {s}\n", .{resStr});
+    allocator.free(resStr);
+
+    std.debug.print("\n", .{});
+}
+
+pub fn main() !void {
+    try run();
+}
+
+test "interation" {
+    try run();
 }