C语言编程入门：50个实战练习题解锁编程技巧

引言

C语言是一种广泛使用的高级编程语言，以其简洁、高效和灵活性而著称。对于编程初学者来说，通过解决实际问题来学习编程是一种非常有效的方法。本篇文章将提供50个实战练习题，帮助读者解锁C语言编程技巧。

练习题

1. 打印Hello World

#include <stdio.h>

int main() {
    printf("Hello, World!\n");
    return 0;
}

2. 变量声明与赋值

#include <stdio.h>

int main() {
    int age = 25;
    printf("I am %d years old.\n", age);
    return 0;
}

3. 数据类型转换

#include <stdio.h>

int main() {
    int num = 10;
    float result = num;
    printf("Result: %.2f\n", result);
    return 0;
}

4. 运算符优先级

#include <stdio.h>

int main() {
    int a = 5, b = 3;
    printf("Result: %d\n", a * b / 2); // 7.5, 整数除法结果为7
    return 0;
}

5. if语句

#include <stdio.h>

int main() {
    int num = 10;
    if (num > 5) {
        printf("The number is greater than 5.\n");
    }
    return 0;
}

6. switch语句

#include <stdio.h>

int main() {
    int day = 3;
    switch (day) {
        case 1:
            printf("Monday\n");
            break;
        case 2:
            printf("Tuesday\n");
            break;
        default:
            printf("Other day\n");
    }
    return 0;
}

7. 循环结构 - for

#include <stdio.h>

int main() {
    for (int i = 1; i <= 5; i++) {
        printf("%d\n", i);
    }
    return 0;
}

8. 循环结构 - while

#include <stdio.h>

int main() {
    int i = 1;
    while (i <= 5) {
        printf("%d\n", i);
        i++;
    }
    return 0;
}

9. 数组操作

#include <stdio.h>

int main() {
    int numbers[5] = {1, 2, 3, 4, 5};
    printf("Array elements:\n");
    for (int i = 0; i < 5; i++) {
        printf("%d\n", numbers[i]);
    }
    return 0;
}

10. 函数定义与调用

#include <stdio.h>

void printMessage() {
    printf("Hello from function.\n");
}

int main() {
    printMessage();
    return 0;
}

11. 指针操作

#include <stdio.h>

int main() {
    int num = 10;
    int *ptr = &num;
    printf("Value of num: %d\n", num);
    printf("Address of num: %p\n", (void *)ptr);
    printf("Value of ptr: %d\n", *ptr);
    return 0;
}

12. 结构体

#include <stdio.h>

typedef struct {
    char name[50];
    int age;
} Person;

int main() {
    Person person;
    strcpy(person.name, "John Doe");
    person.age = 30;
    printf("Name: %s, Age: %d\n", person.name, person.age);
    return 0;
}

13. 文件操作 - 写入

#include <stdio.h>

int main() {
    FILE *file = fopen("example.txt", "w");
    if (file == NULL) {
        printf("Error opening file.\n");
        return 1;
    }
    fprintf(file, "This is a test.\n");
    fclose(file);
    return 0;
}

14. 文件操作 - 读取

#include <stdio.h>

int main() {
    FILE *file = fopen("example.txt", "r");
    if (file == NULL) {
        printf("Error opening file.\n");
        return 1;
    }
    char buffer[100];
    while (fgets(buffer, sizeof(buffer), file)) {
        printf("%s", buffer);
    }
    fclose(file);
    return 0;
}

15. 字符串操作 - strlen

#include <stdio.h>
#include <string.h>

int main() {
    char str[] = "Hello, World!";
    printf("Length of string: %lu\n", strlen(str));
    return 0;
}

16. 字符串操作 - strcpy

#include <stdio.h>
#include <string.h>

int main() {
    char src[] = "Hello, World!";
    char dest[50];
    strcpy(dest, src);
    printf("Copied string: %s\n", dest);
    return 0;
}

17. 字符串操作 - strcat

#include <stdio.h>
#include <string.h>

int main() {
    char str1[] = "Hello, ";
    char str2[] = "World!";
    strcat(str1, str2);
    printf("Concatenated string: %s\n", str1);
    return 0;
}

18. 字符串操作 - strcmp

#include <stdio.h>
#include <string.h>

int main() {
    char str1[] = "Hello";
    char str2[] = "World";
    int result = strcmp(str1, str2);
    if (result == 0) {
        printf("Strings are equal.\n");
    } else if (result < 0) {
        printf("str1 is less than str2.\n");
    } else {
        printf("str1 is greater than str2.\n");
    }
    return 0;
}

19. 指针数组

#include <stdio.h>

int main() {
    char *words[] = {"Hello", "World", "C"};
    for (int i = 0; i < 3; i++) {
        printf("%s\n", words[i]);
    }
    return 0;
}

20. 动态内存分配

#include <stdio.h>
#include <stdlib.h>

int main() {
    int *ptr = (int *)malloc(sizeof(int) * 5);
    if (ptr == NULL) {
        printf("Memory allocation failed.\n");
        return 1;
    }
    for (int i = 0; i < 5; i++) {
        ptr[i] = i;
    }
    for (int i = 0; i < 5; i++) {
        printf("%d\n", ptr[i]);
    }
    free(ptr);
    return 0;
}

21. 链表操作 - 创建链表

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
    int data;
    struct Node *next;
} Node;

Node* createNode(int data) {
    Node *newNode = (Node *)malloc(sizeof(Node));
    if (newNode == NULL) {
        return NULL;
    }
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

int main() {
    Node *head = createNode(1);
    Node *second = createNode(2);
    Node *third = createNode(3);

    head->next = second;
    second->next = third;

    return 0;
}

22. 链表操作 - 插入节点

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
    int data;
    struct Node *next;
} Node;

Node* createNode(int data) {
    Node *newNode = (Node *)malloc(sizeof(Node));
    if (newNode == NULL) {
        return NULL;
    }
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

void insertNode(Node **head, int data, int position) {
    Node *newNode = createNode(data);
    if (position == 0) {
        newNode->next = *head;
        *head = newNode;
        return;
    }
    Node *current = *head;
    for (int i = 0; i < position - 1; i++) {
        if (current == NULL) {
            return;
        }
        current = current->next;
    }
    newNode->next = current->next;
    current->next = newNode;
}

int main() {
    Node *head = createNode(1);
    insertNode(&head, 2, 1);
    insertNode(&head, 3, 2);

    return 0;
}

23. 链表操作 - 删除节点

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
    int data;
    struct Node *next;
} Node;

Node* createNode(int data) {
    Node *newNode = (Node *)malloc(sizeof(Node));
    if (newNode == NULL) {
        return NULL;
    }
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

void deleteNode(Node **head, int data) {
    Node *current = *head;
    Node *previous = NULL;

    while (current != NULL && current->data != data) {
        previous = current;
        current = current->next;
    }

    if (current == NULL) {
        return;
    }

    if (previous == NULL) {
        *head = current->next;
    } else {
        previous->next = current->next;
    }

    free(current);
}

int main() {
    Node *head = createNode(1);
    Node *second = createNode(2);
    Node *third = createNode(3);

    head->next = second;
    second->next = third;

    deleteNode(&head, 2);

    return 0;
}

24. 排序算法 - 冒泡排序

#include <stdio.h>

void bubbleSort(int arr[], int n) {
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr) / sizeof(arr[0]);
    bubbleSort(arr, n);
    printf("Sorted array: \n");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

25. 排序算法 - 选择排序

#include <stdio.h>

void selectionSort(int arr[], int n) {
    for (int i = 0; i < n - 1; i++) {
        int min_idx = i;
        for (int j = i + 1; j < n; j++) {
            if (arr[j] < arr[min_idx]) {
                min_idx = j;
            }
        }
        int temp = arr[min_idx];
        arr[min_idx] = arr[i];
        arr[i] = temp;
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr) / sizeof(arr[0]);
    selectionSort(arr, n);
    printf("Sorted array: \n");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

26. 排序算法 - 插入排序

#include <stdio.h>

void insertionSort(int arr[], int n) {
    int i, key, j;
    for (i = 1; i < n; i++) {
        key = arr[i];
        j = i - 1;

        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr) / sizeof(arr[0]);
    insertionSort(arr, n);
    printf("Sorted array: \n");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

27. 排序算法 - 快速排序

#include <stdio.h>

void swap(int *a, int *b) {
    int t = *a;
    *a = *b;
    *b = t;
}

int partition(int arr[], int low, int high) {
    int pivot = arr[high];
    int i = (low - 1);

    for (int j = low; j <= high - 1; j++) {
        if (arr[j] < pivot) {
            i++;
            swap(&arr[i], &arr[j]);
        }
    }
    swap(&arr[i + 1], &arr[high]);
    return (i + 1);
}

void quickSort(int arr[], int low, int high) {
    if (low < high) {
        int pi = partition(arr, low, high);

        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

int main() {
    int arr[] = {10, 7, 8, 9, 1, 5};
    int n = sizeof(arr) / sizeof(arr[0]);
    quickSort(arr, 0, n - 1);
    printf("Sorted array: \n");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

28. 队列操作 - 创建队列

#include <stdio.h>
#include <stdlib.h>

#define MAX 100

typedef struct {
    int items[MAX];
    int front;
    int rear;
    int size;
} Queue;

void initializeQueue(Queue *q) {
    q->front = q->size = 0;
    q->rear = MAX - 1;
}

int isEmpty(Queue *q) {
    return (q->size == 0);
}

int isFull(Queue *q) {
    return (q->size == MAX);
}

void enqueue(Queue *q, int value) {
    if (isFull(q)) {
        printf("Queue is full.\n");
    } else {
        q->rear = (q->rear + 1) % MAX;
        q->items[q->rear] = value;
        q->size = q->size + 1;
    }
}

int dequeue(Queue *q) {
    int value = -1;
    if (!isEmpty(q)) {
        value = q->items[q->front];
        q->front = (q->front + 1) % MAX;
        q->size = q->size - 1;
    }
    return value;
}

int main() {
    Queue q;
    initializeQueue(&q);

    enqueue(&q, 1);
    enqueue(&q, 2);
    enqueue(&q, 3);
    enqueue(&q, 4);
    enqueue(&q, 5);

    while (!isEmpty(&q)) {
        printf("%d ", dequeue(&q));
    }
    return 0;
}

29. 队列操作 - 队列反转

#include <stdio.h>
#include <stdlib.h>

#define MAX 100

typedef struct {
    int items[MAX];
    int front;
    int rear;
    int size;
} Queue;

void initializeQueue(Queue *q) {
    q->front = q->size = 0;
    q->rear = MAX - 1;
}

int isEmpty(Queue *q) {
    return (q->size == 0);
}

int isFull(Queue *q) {
    return (q->size == MAX);
}

void enqueue(Queue *q, int value) {
    if (isFull(q)) {
        printf("Queue is full.\n");
    } else {
        q->rear = (q->rear + 1) % MAX;
        q->items[q->rear] = value;
        q->size = q->size + 1;
    }
}

int dequeue(Queue *q) {
    int value = -1;
    if (!isEmpty(q)) {
        value = q->items[q->front];
        q->front = (q->front + 1) % MAX;
        q->size = q->size - 1;
    }
    return value;
}

void reverseQueue(Queue *q) {
    Queue tempQueue;
    initializeQueue(&tempQueue);

    while (!isEmpty(q)) {
        enqueue(&tempQueue, dequeue(q));
    }

    while (!isEmpty(&tempQueue)) {
        enqueue(q, dequeue(&tempQueue));
    }
}

int main() {
    Queue q;
    initializeQueue(&q);

    enqueue(&q, 1);
    enqueue(&q, 2);
    enqueue(&q, 3);
    enqueue(&q, 4);
    enqueue(&q, 5);

    reverseQueue(&q);

    while (!isEmpty(&q)) {
        printf("%d ", dequeue(&q));
    }
    return 0;
}

30. 栈操作 - 创建栈

”`c #include #include

#define MAX 100

typedef struct {

int items[MAX];
int top;
int size;

} Stack;

void initializeStack(Stack *s) {

s->top = -1;
s->size = 0;

}

int isEmpty(Stack *s) {

return (s->size == 0);

}

int isFull(Stack *s) {