CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-04 03:00:06 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format the C code in Clang-Format Style: Microsoft

Browse Source
This commit is contained in:
krahets
2023-04-17 21:13:15 +08:00
parent 1d6b7a5644
commit 9a98ff8a5e
46 changed files with 215 additions and 216 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
codes/c/chapter_stack_and_queue/array_deque.c
View File

@@ -18,10 +18,10 @@ typedef struct ArrayDeque ArrayDeque;
/* 构造方法 */
ArrayDeque *newArrayDeque(int capacity) {
ArrayDeque *deque = (ArrayDeque *) malloc(sizeof(ArrayDeque));
ArrayDeque *deque = (ArrayDeque *)malloc(sizeof(ArrayDeque));
// 初始化数组
deque->queCapacity = capacity;
deque->nums = (int *) malloc(sizeof(int) * deque->queCapacity);
deque->nums = (int *)malloc(sizeof(int) * deque->queCapacity);
deque->front = deque->queSize = 0;
return deque;
}
@@ -85,7 +85,7 @@ void pushLast(ArrayDeque *deque, int num) {
int peekFirst(ArrayDeque *deque) {
// 访问异常：双向队列为空
assert(empty(deque) == 0);
return deque->nums[deque->front];
return deque->nums[deque->front];
}
/* 访问队尾元素 */
@@ -93,7 +93,7 @@ int peekLast(ArrayDeque *deque) {
// 访问异常：双向队列为空
assert(empty(deque) == 0);
int last = dequeIndex(deque, deque->front + deque->queSize - 1);
return deque->nums[last];
return deque->nums[last];
}
/* 队首出队 */
@@ -122,7 +122,6 @@ void printArrayDeque(ArrayDeque *deque) {
printArray(arr, deque->queSize);
}
/* Driver Code */
int main() {
/* 初始化队列 */
@@ -166,6 +165,6 @@ int main() {
// 释放内存
delArrayDeque(deque);
return 0;
}

11
codes/c/chapter_stack_and_queue/array_queue.c
View File

@@ -18,10 +18,10 @@ typedef struct ArrayQueue ArrayQueue;
/* 构造方法 */
ArrayQueue *newArrayQueue(int capacity) {
ArrayQueue *queue = (ArrayQueue *) malloc(sizeof(ArrayQueue));
ArrayQueue *queue = (ArrayQueue *)malloc(sizeof(ArrayQueue));
// 初始化数组
queue->queCapacity = capacity;
queue->nums = (int *) malloc(sizeof(int) * queue->queCapacity);
queue->nums = (int *)malloc(sizeof(int) * queue->queCapacity);
queue->front = queue->queSize = 0;
return queue;
}
@@ -49,8 +49,8 @@ bool empty(ArrayQueue *queue) {
/* 访问队首元素 */
int peek(ArrayQueue *queue) {
assert(size(queue) != 0);
return queue->nums[queue->front];
assert(size(queue) != 0);
return queue->nums[queue->front];
}
/* 入队 */
@@ -85,7 +85,6 @@ void printArrayQueue(ArrayQueue *queue) {
printArray(arr, queue->queSize);
}
/* Driver Code */
int main() {
/* 初始化队列 */
@@ -129,4 +128,4 @@ int main() {
// 释放内存
delArrayQueue(queue);
return 0;
}
}

4
codes/c/chapter_stack_and_queue/array_stack.c
View File

@@ -67,7 +67,7 @@ int pop(arrayStack *s) {
/* Driver Code */
int main() {
/* 初始化栈 */
arrayStack * stack = newArrayStack();
arrayStack *stack = newArrayStack();
/* 元素入栈 */
push(stack, 1);
@@ -100,4 +100,4 @@ int main() {
free(stack);
return 0;
}
}

21
codes/c/chapter_stack_and_queue/linkedlist_deque.c
View File

@@ -17,7 +17,7 @@ typedef struct DoublyListNode DoublyListNode;
/* 双向链表节点构造方法 */
DoublyListNode *newDoublyListNode(int num) {
DoublyListNode* new = (DoublyListNode *) malloc(sizeof(DoublyListNode));
DoublyListNode *new = (DoublyListNode *)malloc(sizeof(DoublyListNode));
new->val = num;
new->next = NULL;
new->prev = NULL;
@@ -39,7 +39,7 @@ typedef struct LinkedListDeque LinkedListDeque;
/* 构造方法 */
LinkedListDeque *newLinkedListDeque() {
LinkedListDeque *deque = (LinkedListDeque *) malloc(sizeof(LinkedListDeque));
LinkedListDeque *deque = (LinkedListDeque *)malloc(sizeof(LinkedListDeque));
deque->front = NULL;
deque->rear = NULL;
deque->queSize = 0;
@@ -48,7 +48,7 @@ LinkedListDeque *newLinkedListDeque() {
/* 析构方法 */
void delLinkedListdeque(LinkedListDeque *deque) {
// 释放所有节点
for (int i=0; i<deque->queSize && deque->front != NULL; i++) {
for (int i = 0; i < deque->queSize && deque->front != NULL; i++) {
DoublyListNode *tmp = deque->front;
deque->front = deque->front->next;
free(tmp);
@@ -75,11 +75,11 @@ void push(LinkedListDeque *deque, int num, bool isFront) {
deque->front = deque->rear = node;
}
// 队首入队操作
else if (isFront){
else if (isFront) {
// 将 node 添加至链表头部
deque->front->prev = node;
node->next = deque->front;
deque->front = node;// 更新头节点
deque->front = node; // 更新头节点
}
// 对尾入队操作
else {
@@ -119,7 +119,7 @@ int pop(LinkedListDeque *deque, bool isFront) {
return -1;
int val;
// 队首出队操作
if(isFront) {
if (isFront) {
val = peekFirst(deque); // 暂存头节点值
DoublyListNode *fNext = deque->front->next;
if (fNext) {
@@ -140,7 +140,7 @@ int pop(LinkedListDeque *deque, bool isFront) {
}
deque->rear = rPrev; // 更新尾节点
}
deque->queSize--; // 更新队列长度
deque->queSize--; // 更新队列长度
return val;
}
@@ -160,9 +160,9 @@ void printLinkedListDeque(LinkedListDeque *deque) {
// 拷贝链表中的数据到数组
int i;
DoublyListNode *node;
for (i=0, node = deque->front; i < deque->queSize; i++){
arr[i] = node->val;
node = node->next;
for (i = 0, node = deque->front; i < deque->queSize; i++) {
arr[i] = node->val;
node = node->next;
}
printArray(arr, deque->queSize);
}
@@ -211,4 +211,3 @@ int main() {
delLinkedListdeque(deque);
return 0;
}

11
codes/c/chapter_stack_and_queue/linkedlist_queue.c
View File

@@ -16,7 +16,7 @@ typedef struct LinkedListQueue LinkedListQueue;
/* 构造方法 */
LinkedListQueue *newLinkedListQueue() {
LinkedListQueue *queue = (LinkedListQueue *) malloc(sizeof(LinkedListQueue));
LinkedListQueue *queue = (LinkedListQueue *)malloc(sizeof(LinkedListQueue));
queue->front = NULL;
queue->rear = NULL;
queue->queSize = 0;
@@ -25,7 +25,7 @@ LinkedListQueue *newLinkedListQueue() {
/* 析构方法 */
void delLinkedListQueue(LinkedListQueue *queue) {
// 释放所有节点
for (int i=0; i<queue->queSize && queue->front != NULL; i++) {
for (int i = 0; i < queue->queSize && queue->front != NULL; i++) {
ListNode *tmp = queue->front;
queue->front = queue->front->next;
free(tmp);
@@ -46,13 +46,13 @@ bool empty(LinkedListQueue *queue) {
/* 入队 */
void push(LinkedListQueue *queue, int num) {
// 尾节点处添加 node
// 尾节点处添加 node
ListNode *node = newListNode(num);
// 如果队列为空，则令头、尾节点都指向该节点
if (queue->front == NULL) {
queue->front = node;
queue->rear = node;
}
}
// 如果队列不为空，则将该节点添加到尾节点后
else {
queue->rear->next = node;
@@ -82,7 +82,7 @@ void printLinkedListQueue(LinkedListQueue *queue) {
// 拷贝链表中的数据到数组
int i;
ListNode *node;
for (i=0, node = queue->front; i < queue->queSize && queue->front != queue->rear; i++){
for (i = 0, node = queue->front; i < queue->queSize && queue->front != queue->rear; i++) {
arr[i] = node->val;
node = node->next;
}
@@ -125,4 +125,3 @@ int main() {
return 0;
}

12
codes/c/chapter_stack_and_queue/linkedlist_stack.c
View File

@@ -9,7 +9,7 @@
/* 基于链表实现的栈 */
struct linkedListStack {
ListNode *top; // 将头节点作为栈顶
int size; // 栈的长度
int size; // 栈的长度
};
typedef struct linkedListStack linkedListStack;
@@ -54,11 +54,11 @@ int peek(linkedListStack *s) {
/* 入栈 */
void push(linkedListStack *s, int num) {
assert(s);
ListNode *node = (ListNode *) malloc(sizeof(ListNode));
node->next = s->top; // 更新新加节点指针域
node->val = num; // 更新新加节点数据域
s->top = node; // 更新栈顶
s->size++; // 更新栈大小
ListNode *node = (ListNode *)malloc(sizeof(ListNode));
node->next = s->top; // 更新新加节点指针域
node->val = num; // 更新新加节点数据域
s->top = node; // 更新栈顶
s->size++; // 更新栈大小
}
/* 出栈 */