中北数据结构2023真题

雪雾:
设计一个算法，将一个节点值为自然数的单列表拆分成两个单列表，原表中值为偶数的节点保留，而值为奇数的节点，按他们在原表的相对次序组成一个新的单列表

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

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

void splitList(Node* head, Node** evenList, Node** oddList) {
   
    Node* evenTail = NULL;
    Node* oddTail = NULL;

    while (head != NULL) {
   
        if (head->data % 2 == 0) {
   
            if (*evenList == NULL) {
   
                *evenList = head;
                evenTail = head;
            } else {
   
                evenTail->next = head;
                evenTail = evenTail->next;
            }
        } else {
   
            if (*oddList == NULL) {
   
                *oddList = head;
                oddTail = head;
            } else {
   
                oddTail->next = head;
                oddTail = oddTail->next;
            }
        }
        head = head->next;
    }

    if (evenTail != NULL) evenTail->next = NULL;
    if (oddTail != NULL) oddTail->next = NULL;
}

// Example usage:
// Call splitList with your original list and two empty lists for even and odd nodes.
// Node* originalList;
// Node* evenList = NULL;
// Node* oddList = NULL;
// splitList(originalList, &evenList, &oddList);

雪雾:
顺序表a和b其元素值均被从小到大的顺序排列，编写一个算法，将它们合并成一个顺序表c，要求c的元素也按从小到大的升序排列

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

void mergeSortedArrays(int a[], int m, int b[], int n, int c[]) {
   
    int i = 0, j = 0, k = 0;

    while (i < m && j < n) {
   
        if (a[i] < b[j]) {
   
            c[k++] = a[i++];
        } else {
   
            c[k++] = b[j++];
        }
    }

    while (i < m) {
   
        c[k++] = a[i++];
    }

    while (j < n) {
   
        c[k++] = b[j++];
    }
}

// Example usage:
// int a[] = {1, 3, 5, 7};
// int b[] = {2, 4, 6, 8};
// in