周正奇的作业

CMakeLists.txt

@@ -5,3 +5,8 @@ set(CMAKE_C_STANDARD 11)
 set(CMAKE_CXX_STANDARD 17)
 
 add_subdirectory(level1)
+add_subdirectory(level0)
+add_subdirectory(level2)
+add_subdirectory(class)
+add_subdirectory(my_study)
+add_subdirectory(design)

class/CMakeLists.txt

@@ -0,0 +1,23 @@
+project(class)
+
+add_executable(struct struct/main.c)
+
+add_executable(pop pop/main.c)
+
+add_executable(choose choose/main.c)
+
+add_executable(insert insert/main.c)
+
+add_executable(stack stack/main.c)
+
+add_executable(others_1 others_1/main.c)
+
+add_executable(reverse_bolan_SeqLink reverse_bolan_SeqLink/main.c
+        reverse_bolan_SeqLink/SeqList.c
+        reverse_bolan_SeqLink/SeqList.h)
+
+add_executable(list list/main.c)
+
+add_executable(queue queue/main.c
+        queue/Queue.c
+        queue/Queue.h)

class/choose/main.c

@@ -0,0 +1,33 @@
+#include <stdio.h>
+#include <windows.h>
+
+void swap(int* a, int* b) {
+    int t = *a;
+    *a = *b;
+    *b = t;
+}
+
+void Choose(int a[], int n) {
+    for (int i = 0; i < n - 1; ++i) {
+        int k = i;
+        for (int j = i + 1; j < n; ++j) {
+            if (a[j] < a[k]) {
+                k = j;
+            }
+        }
+        swap(a + i, a + k);
+    }
+}
+
+int main()
+{
+    int mas[] = {3,4,1,5,8,2,99,0},num = sizeof (mas)/ sizeof(mas[0]);
+    Choose(mas,num);
+    for(int i = 0;i < sizeof (mas) / sizeof(mas[0]);i ++)
+    {
+        printf("%d ",mas[i]);
+    }
+    system("pause");
+    printf("\n");
+    return 0;
+}

class/insert/main.c

@@ -0,0 +1,49 @@
+#include <stdio.h>
+#include <windows.h>
+
+void insert(int a[],int n,int m)
+{
+    int temp = a[n];
+    for(int i = n - 1;i > m;i --)
+    {
+        a[i + 1] = a[i];
+    }
+    a[m + 1] = temp;
+}
+
+void Insert_sort(int a[], int n) {
+
+    for(int i = 1;i < n;++i)
+    {
+        int count = 0;
+        while(count < i){
+            if(a[i] < a[count]){
+                insert(a,i,count - 1);
+                break;
+            }
+            else if(a[i] >= a[count] && a[i] <= a[1 + count])
+            {
+                insert(a,i,count);
+                break;
+            }
+            else
+            {
+                count ++;
+            }
+        }
+
+    }
+}
+
+int main()
+{
+    int mas[] = {4,3,1,8,5,99,17,20,2,7},num = sizeof (mas)/ sizeof(mas[0]);
+    Insert_sort(mas, num);
+    for(int i = 0;i < sizeof (mas) / sizeof(mas[0]);i ++)
+    {
+        printf("%d ",mas[i]);
+    }
+    system("pause");
+    printf("\n");
+    return 0;
+}

class/list/main.c

@@ -0,0 +1,15 @@
+#include <stdio.h>
+#include <stdlib.h>
+//使用链表指向 1【】 2【】 3【】
+//1 h->x  2 h-> 1.x  3 p insert  4 delete h
+typedef struct Node
+{
+    int data;//定义数据域
+    struct Node *next;//定义后继指针域
+}Node;
+
+int main()
+{
+    Node * h = (Node*) malloc(sizeof (Node *));
+
+}

class/others_1/main.c

@@ -0,0 +1,84 @@
+#include <stdio.h>
+#include <stdbool.h>
+#include <malloc.h>
+#include <string.h>
+
+typedef struct ST
+{
+    int sp;
+    int *a;
+    int size;
+}stack;
+
+stack* CreateStack(int size);
+void push(stack *st,int v);
+int pop(stack *st);
+bool is_full(stack *st);
+bool is_empty(stack *st);
+
+int main() {
+    int res;
+    char c;
+    stack *st=CreateStack(100);
+    for(scanf("%c",&c);c!='\n';scanf("%c",&c))
+    {
+        if(c>='0'&&c<='9')
+        {
+            push(st,c-'0');
+        }
+        else
+        {
+            int a,b;
+            b=pop(st);
+            a=pop(st);
+            switch(c)
+            {
+                case'+':
+                    push(st,a+b);
+                    break;
+                case'-':
+                    push(st,a-b);
+                    break;
+                case'*':
+                    push(st,a*b);
+                    break;
+                case'/':
+                    push(st,a/b);
+                    break;
+            }
+        }
+    }
+    res=pop(st);
+    printf("Result:%d\n",res);
+    return 0;
+}
+stack *CreateStack(int size)
+{
+    stack *ret=malloc(sizeof(stack));
+    memset(ret,0,sizeof(stack));
+    ret->a=malloc(sizeof(int)*(size+1));
+    memset(ret->a,0,sizeof(int)*(size+1));
+    ret->size=size;
+    return ret;
+}
+void push(stack *st,int v)
+{
+    if(is_full(st)) return;
+    st->a[st->sp++]=v;
+    return;
+}
+int pop(stack *st)
+{
+    int ret;
+    if(is_empty(st)) return 0;
+    ret=st->a[--(st->sp)];
+    return ret;
+}
+bool is_full(stack *st)
+{
+    return st->sp==st->size;
+}
+bool is_empty(stack *st)
+{
+    return st->sp==0;
+}

class/pop/main.c

@@ -0,0 +1,45 @@
+#include <stdio.h>
+#include <windows.h>
+void Exchange(int *a,int *b);
+void Pop(int a[],int num);
+
+int main()
+{
+    int mas[] = {3,4,1,5,8,2,99,0},num = sizeof (mas)/ sizeof(mas[0]);
+    Pop(mas,num);
+    for(int i = 0;i < sizeof (mas) / sizeof(mas[0]);i ++)
+    {
+        printf("%d ",mas[i]);
+    }
+    system("pause");
+    printf("\n");
+    return 0;
+}
+
+void Exchange(int *a,int *b)
+{
+    int temp = *a;
+    *a = *b;
+    *b = temp;
+}
+
+void Pop(int a[],int num)
+{
+    int flag = 0,count = 0;
+    while (flag < num - 1){
+        flag = 0;
+        for(int i = 0;i < num - 1 - flag;++i)
+        {
+            if(a[i] > a[i + 1])
+            {
+                Exchange(a + i,a + i + 1);
+                count = 0;
+            }
+            else
+            {
+                ++count;
+            }
+        }
+        flag += count;
+    }
+}

class/queue/Queue.c

@@ -0,0 +1,69 @@
+#include "Queue.h"
+
+Queue * create_queue(int num){
+
+    //申请队列空间，即数组空间
+    SeqQueue  queue = (Queue *) malloc(sizeof(Queue) * num);
+
+    //判断队列空间申请失败
+    if(!queue){
+        printf("malloc fail!");
+        return NULL;
+    }
+
+    //初始化队列容量
+    queue->capacity = num;
+
+    //初始化队列元素个数
+    queue->size = 0;
+
+    //初始化队列值为空
+    queue->data = (QueueDataType*)malloc(num * sizeof(QueueDataType));
+    if (!queue->data) {
+        printf("Memory allocation for data array failed.\n");
+        free(queue);  // Clean up and free the queue struct
+        return NULL;
+    }
+    for (int i = 1; i < num; ++i) {
+        queue->data[i] = 0;
+    }
+
+    //返回队列指针
+    return queue;
+}
+
+int is_empty(Queue* queue)
+{
+    if(0 == queue->size)
+        return 1;
+    else
+        return 0;
+}
+
+void append(Queue* queue, int x)
+{
+    //判断队列不存在
+    if(!queue){
+        return;
+    }
+
+    //判断队列元素是否为满，拿队列当前的长度去跟数组的最大值作比较
+    if(queue->size == queue->capacity){
+        printf("队列元素已满！\n");
+        return;
+    }
+
+    //插入元素(进队)
+    queue->data[queue->size] = x;
+
+    //元素入队，队列长度增加
+    queue->size ++;
+}
+
+void print_queue(Queue* queue)
+{
+    for (int i = 0; i < queue->size; ++i) {
+        printf("%d ",queue->data[i]);
+    }
+    printf("\n");
+}

class/queue/Queue.h

@@ -0,0 +1,18 @@
+#pragma once
+#include <stdio.h>
+#include <stdlib.h>
+#include <assert.h>
+
+typedef int QueueDataType;
+
+typedef struct Queue{
+
+    QueueDataType *data;            //顺序存储 数组模拟的队列
+    int size;                //队列的大小(队列中元素的个数)
+    int capacity;
+}Queue,*SeqQueue;
+
+Queue * create_queue(int num);
+int is_empty(Queue* queue);
+void append(Queue* queue, int x);
+void print_queue(Queue* queue);

class/queue/main.c

@@ -0,0 +1,21 @@
+#include "Queue.h"
+
+
+int main() {
+    Queue* queue=create_queue(3);
+    assert(is_empty(queue));
+
+    append(queue,1);//queue->append(1);
+    append(queue,2);
+    append(queue,3);
+    print_queue(queue);
+//    assert(is_full(queue));
+//
+//    int x=pop(queue);
+//    assert(x==1);
+//    assert(pop(queue)==2);//queue->pop()==2
+//    assert(pop(queue)==3);
+
+//    assert(is_empty(queue));
+    return 0;
+}