CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-09 05:44:13 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: Update C code for compatibility with the MSVC compiler (#949)

Browse Source 
* Replace VLA with malloc
Replace VLA with malloc to make C code
compatible with cl compiler on Windows.

* Fix C code for CI compiler.

* Fix C code compability to CI.

* check the trigger
This commit is contained in:
Yudong Jin
2023-11-17 00:29:54 +08:00
committed by GitHub
parent e4aa76ed3e
commit f7c41b6bef
23 changed files with 235 additions and 174 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -73,16 +73,6 @@ void pop(ArrayQueue *queue) {
queue->queSize--;
}
/* 打印队列 */
void printArrayQueue(ArrayQueue *queue) {
int arr[queue->queSize];
// 拷贝
for (int i = 0, j = queue->front; i < queue->queSize; i++, j++) {
arr[i] = queue->nums[j % queue->queCapacity];
}
printArray(arr, queue->queSize);
}
/* Driver Code */
int main() {
/* 初始化队列 */
@@ -96,7 +86,7 @@ int main() {
push(queue, 5);
push(queue, 4);
printf("队列 queue = ");
printArrayQueue(queue);
printArray(queue->nums, queue->queSize);
/* 访问队首元素 */
int peekNum = peek(queue);
@@ -105,7 +95,7 @@ int main() {
/* 元素出队 */
pop(queue);
printf("出队元素 pop = %d ，出队后 queue = ", peekNum);
printArrayQueue(queue);
printArray(queue->nums, queue->queSize);
/* 获取队列的长度 */
int queueSize = size(queue);
@@ -120,7 +110,7 @@ int main() {
push(queue, i);
pop(queue);
printf("第 %d 轮入队 + 出队后 queue = ", i);
printArrayQueue(queue);
printArray(queue->nums, queue->queSize);
}
// 释放内存