add zig codes for Section Queue and Deque (#291)

* add zig codes for Section 'Queue'

* update zig codes for Section 'Queue'

* update zig codes for Section 'Queue'

* update zig codes for Section 'Queue'

* update zig codes for Section 'Queue' and 'Deque'

* update zig codes for Section 'Queue' and 'Deque'

* update zig codes for Section 'Queue' and 'Deque'

codes/zig/chapter_stack_and_queue/deque.zig

@@ -0,0 +1,51 @@
+// File: deque.zig
+// Created Time: 2023-01-15
+// Author: sjinzh (sjinzh@gmail.com)
+
+const std = @import("std");
+const inc = @import("include");
+
+// Driver Code
+pub fn main() !void {
+    // 初始化双向队列
+    const L = std.TailQueue(i32);
+    var deque = L{};  
+
+    // 元素入队
+    var node1 = L.Node{ .data = 2 };
+    var node2 = L.Node{ .data = 5 };
+    var node3 = L.Node{ .data = 4 };
+    var node4 = L.Node{ .data = 3 };
+    var node5 = L.Node{ .data = 1 };
+    deque.append(&node1);
+    deque.append(&node2);
+    deque.append(&node3);
+    deque.prepend(&node4);
+    deque.prepend(&node5);
+    std.debug.print("双向队列 deque = ", .{});
+    inc.PrintUtil.printQueue(i32, deque);
+
+    // 访问元素
+    var peekFirst = deque.first.?.data;
+    std.debug.print("\n队首元素 peekFirst = {}", .{peekFirst});
+    var peekLast = deque.last.?.data;
+    std.debug.print("\n队首元素 peekLast = {}", .{peekLast});
+
+    // 元素出队
+    var pollFirst = deque.popFirst().?.data;
+    std.debug.print("\n队首出队元素 pollFirst = {}，队首出队后 deque = ", .{pollFirst});
+    inc.PrintUtil.printQueue(i32, deque);
+    var pollLast = deque.pop().?.data;
+    std.debug.print("\n队尾出队元素 pollLast = {}，队尾出队后 deque = ", .{pollLast});
+    inc.PrintUtil.printQueue(i32, deque);
+
+    // 获取双向队列的长度
+    var size = deque.len;
+    std.debug.print("\n双向队列长度 size = {}", .{size});
+
+    // 判断队列是否为空
+    var isEmpty = if (deque.len == 0) true else false;
+    std.debug.print("\n双向队列是否为空 = {}", .{isEmpty});
+
+    _ = try std.io.getStdIn().reader().readByte();
+}