hello-algo/zh-hant/codes/zig/chapter_searching/linear_search.zig

// File: linear_search.zig
// Created Time: 2023-01-13
// Author: codingonion (coderonion@gmail.com)

const std = @import("std");
const inc = @import("include");

// 線性查詢（陣列）
fn linearSearchArray(comptime T: type, nums: std.ArrayList(T), target: T) T {
    // 走訪陣列
    for (nums.items, 0..) |num, i| {
        // 找到目標元素， 返回其索引
        if (num == target) {
            return @intCast(i);
        }
    }
    // 未找到目標元素，返回 -1
    return -1;
}

// 線性查詢（鏈結串列）
pub fn linearSearchLinkedList(comptime T: type, node: ?*inc.ListNode(T), target: T) ?*inc.ListNode(T) {
    var head = node;
    // 走訪鏈結串列
    while (head != null) {
        // 找到目標節點，返回之
        if (head.?.val == target) return head;
        head = head.?.next;
    }
    return null;
}

// Driver Code
pub fn main() !void {
    var target: i32 = 3;

    // 在陣列中執行線性查詢
    var nums = std.ArrayList(i32).init(std.heap.page_allocator);
    defer nums.deinit();
    try nums.appendSlice(&[_]i32{ 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 });
    var index = linearSearchArray(i32, nums, target);
    std.debug.print("目標元素 3 的索引 = {}\n", .{index});

    // 在鏈結串列中執行線性查詢
    var mem_arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
    defer mem_arena.deinit();
    const mem_allocator = mem_arena.allocator();
    var head = try inc.ListUtil.listToLinkedList(i32, mem_allocator, nums);
    var node = linearSearchLinkedList(i32, head, target);
    std.debug.print("目標節點值 3 的對應節點物件為 ", .{});
    try inc.PrintUtil.printLinkedList(i32, node);

    _ = try std.io.getStdIn().reader().readByte();
}