Pep/8环境下字符型链表改造实现技术求助

Got it, let's walk through how to adapt your existing number-linked list to store char values while keeping that sorted output behavior you had before. Here's a straightforward breakdown with code examples:

1. Modify the Node Structure #

First, swap out the int data type in your node definition for char. This is the core change—char values in C are just 8-bit integers under the hood, so sorting logic will work similarly once we adjust comparisons to use ASCII values (the default for char comparisons).

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

// Updated node structure for char storage
typedef struct Node {
    char data;
    struct Node* next;
} Node;

2. Update the Sorted Insert Logic #

Your existing insertion logic for numbers relies on comparing numeric values. For chars, we'll compare their ASCII values directly (which is what the </> operators do by default for char types). This means:

• Numeric characters ('0' to '9') will sort correctly just like your original number list (since their ASCII values are consecutive and ascending)
• Letters will sort by their ASCII order (uppercase first, then lowercase, since 'A' = 65, 'a' = 97)
• Special characters will follow their ASCII positions too

Here's the updated insert function:

// Create a new node with a char value
Node* create_node(char c) {
    Node* new_node = (Node*)malloc(sizeof(Node));
    new_node->data = c;
    new_node->next = NULL;
    return new_node;
}

// Insert a char into the sorted linked list
void insert_sorted(Node** head, char c) {
    Node* new_node = create_node(c);

    // Insert at head if list is empty or new char is smaller than head
    if (*head == NULL || new_node->data < (*head)->data) {
        new_node->next = *head;
        *head = new_node;
        return;
    }

    // Traverse to find the correct insertion point
    Node* current = *head;
    while (current->next != NULL && current->next->data < new_node->data) {
        current = current->next;
    }

    new_node->next = current->next;
    current->next = new_node;
}

3. Adjust Input/Output Handling #

Since you're now working with chars instead of integers, you'll need to tweak how you read input and print output:

• Use %c format specifiers instead of %d
• Add a space before %c in scanf to skip whitespace (so spaces/newlines between input chars don't get stored as nodes)

Here's a complete main function example:

// Print the sorted linked list
void print_list(Node* head) {
    Node* current = head;
    while (current != NULL) {
        printf("%c", current->data);
        current = current->next;
    }
    printf("\n");
}

int main() {
    Node* head = NULL;
    char input_char;

    printf("Enter characters separated by spaces (press Ctrl+D to finish):\n");
    // Read chars, skipping whitespace
    while (scanf(" %c", &input_char) != EOF) {
        insert_sorted(&head, input_char);
    }

    printf("Sorted output: ");
    print_list(head);

    // Clean up memory to avoid leaks
    Node* temp;
    while (head != NULL) {
        temp = head;
        head = head->next;
        free(temp);
    }

    return 0;
}

4. Extra: Case-Insensitive Sorting (Optional) #

If you want letters to sort without case sensitivity (e.g., 'A' and 'a' are treated the same), include <ctype.h> and modify the comparison to use tolower() or toupper():

#include <ctype.h>

// Updated comparison in insert_sorted
while (current->next != NULL && tolower(current->next->data) < tolower(new_node->data)) {
    current = current->next;
}

Test Example #

If you input b a d c, the code will output abcd. If you input 3 5 4 2 1 (as character inputs), it will output 12345—just like your original number list!

内容的提问来源于stack exchange，提问作者Rekch