深入剖析C语言标准库函数的实现与应用

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

int isPalindrome(char str[]) {
    int len = strlen(str);
    int start = 0, end = len - 1;
    
    while (start < end) {
        if (str[start] != str[end]) {
            return 0;
        }
        start++;
        end--;
    }
    
    return 1;
}

int main() {
    char str[100];
    
    printf("请输入一个字符串：");
    gets(str);
    
    if (isPalindrome(str)) {
        printf("%s是回文串。
", str);
    } else {
        printf("%s不是回文串。
", str);
    }
    
    return 0;
}

#include <stdio.h>

void printArray(int arr[], int size) {
    printf("[");
    for (int i = 0; i < size; i++) {
        if (i > 0) {
            printf(", ");
        }
        printf("%d", arr[i]);
    }
    printf("]");
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int size = sizeof(arr) / sizeof(arr[0]);
    
    printf("数组的元素为：");
    printArray(arr, size);
    
    return 0;
}

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

int* mergeArrays(int arr1[], int size1, int arr2[], int size2) {
    int* mergedArray = (int*)malloc((size1 + size2) * sizeof(int));
    int i = 0, j = 0, k = 0;
    
    while (i < size1 && j < size2) {
        if (arr1[i] < arr2[j]) {
            mergedArray[k++] = arr1[i++];
        } else {
            mergedArray[k++] = arr2[j++];
        }
    }
    
    while (i < size1) {
        mergedArray[k++] = arr1[i++];
    }
    
    while (j < size2) {
        mergedArray[k++] = arr2[j++];
    }
    
    return mergedArray;
}

int main() {
    int arr1[] = {1, 3, 5};
    int arr2[] = {2, 4, 6};
    int size1 = sizeof(arr1) / sizeof(arr1[0]);
    int size2 = sizeof(arr2) / sizeof(arr2[0]);
    
    int* mergedArray = mergeArrays(arr1, size1, arr2, size2);
    
    printf("合并后的数组为：");
    for (int i = 0; i < size1 + size2; i++) {
        printf("%d ", mergedArray[i]);
    }
    
    free(mergedArray);
    
    return 0;
}