Simplify struct declarations of C.

Use PascalCase for all structs in C.
SImplify n_queens.c
Format C code for chapter of graph.

codes/c/chapter_stack_and_queue/array_deque.c

@@ -7,18 +7,16 @@
 #include "../utils/common.h"
 
 /* 基于环形数组实现的双向队列 */
-struct arrayDeque {
+typedef struct {
     int *nums;       // 用于存储队列元素的数组
     int front;       // 队首指针，指向队首元素
     int queSize;     // 尾指针，指向队尾 + 1
     int queCapacity; // 队列容量
-};
-
-typedef struct arrayDeque arrayDeque;
+} ArrayDeque;
 
 /* 构造函数 */
-arrayDeque *newArrayDeque(int capacity) {
-    arrayDeque *deque = (arrayDeque *)malloc(sizeof(arrayDeque));
+ArrayDeque *newArrayDeque(int capacity) {
+    ArrayDeque *deque = (ArrayDeque *)malloc(sizeof(ArrayDeque));
     // 初始化数组
     deque->queCapacity = capacity;
     deque->nums = (int *)malloc(sizeof(int) * deque->queCapacity);
@@ -27,28 +25,28 @@ arrayDeque *newArrayDeque(int capacity) {
 }
 
 /* 析构函数 */
-void delArrayDeque(arrayDeque *deque) {
+void delArrayDeque(ArrayDeque *deque) {
     free(deque->nums);
     deque->queCapacity = 0;
 }
 
 /* 获取双向队列的容量 */
-int capacity(arrayDeque *deque) {
+int capacity(ArrayDeque *deque) {
     return deque->queCapacity;
 }
 
 /* 获取双向队列的长度 */
-int size(arrayDeque *deque) {
+int size(ArrayDeque *deque) {
     return deque->queSize;
 }
 
 /* 判断双向队列是否为空 */
-bool empty(arrayDeque *deque) {
+bool empty(ArrayDeque *deque) {
     return deque->queSize == 0;
 }
 
 /* 计算环形数组索引 */
-int dequeIndex(arrayDeque *deque, int i) {
+int dequeIndex(ArrayDeque *deque, int i) {
     // 通过取余操作实现数组首尾相连
     // 当 i 越过数组尾部时，回到头部
     // 当 i 越过数组头部后，回到尾部
@@ -56,7 +54,7 @@ int dequeIndex(arrayDeque *deque, int i) {
 }
 
 /* 队首入队 */
-void pushFirst(arrayDeque *deque, int num) {
+void pushFirst(ArrayDeque *deque, int num) {
     if (deque->queSize == capacity(deque)) {
         printf("双向队列已满\r\n");
         return;
@@ -70,7 +68,7 @@ void pushFirst(arrayDeque *deque, int num) {
 }
 
 /* 队尾入队 */
-void pushLast(arrayDeque *deque, int num) {
+void pushLast(ArrayDeque *deque, int num) {
     if (deque->queSize == capacity(deque)) {
         printf("双向队列已满\r\n");
         return;
@@ -83,14 +81,14 @@ void pushLast(arrayDeque *deque, int num) {
 }
 
 /* 访问队首元素 */
-int peekFirst(arrayDeque *deque) {
+int peekFirst(ArrayDeque *deque) {
     // 访问异常：双向队列为空
     assert(empty(deque) == 0);
     return deque->nums[deque->front];
 }
 
 /* 访问队尾元素 */
-int peekLast(arrayDeque *deque) {
+int peekLast(ArrayDeque *deque) {
     // 访问异常：双向队列为空
     assert(empty(deque) == 0);
     int last = dequeIndex(deque, deque->front + deque->queSize - 1);
@@ -98,7 +96,7 @@ int peekLast(arrayDeque *deque) {
 }
 
 /* 队首出队 */
-int popFirst(arrayDeque *deque) {
+int popFirst(ArrayDeque *deque) {
     int num = peekFirst(deque);
     // 队首指针向后移动一位
     deque->front = dequeIndex(deque, deque->front + 1);
@@ -107,14 +105,14 @@ int popFirst(arrayDeque *deque) {
 }
 
 /* 队尾出队 */
-int popLast(arrayDeque *deque) {
+int popLast(ArrayDeque *deque) {
     int num = peekLast(deque);
     deque->queSize--;
     return num;
 }
 
 /* 打印队列 */
-void printArrayDeque(arrayDeque *deque) {
+void printArrayDeque(ArrayDeque *deque) {
     int arr[deque->queSize];
     // 拷贝
     for (int i = 0, j = deque->front; i < deque->queSize; i++, j++) {
@@ -127,7 +125,7 @@ void printArrayDeque(arrayDeque *deque) {
 int main() {
     /* 初始化队列 */
     int capacity = 10;
-    arrayDeque *deque = newArrayDeque(capacity);
+    ArrayDeque *deque = newArrayDeque(capacity);
     pushLast(deque, 3);
     pushLast(deque, 2);
     pushLast(deque, 5);