基于你之前的设计的算法进行改进，使其更加简洁，实现单链表反转

以下是一个更加简洁的C语言实现单链表反转的算法：

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

typedef struct ListNode {
    int val;
    struct ListNode *next;
} ListNode;

ListNode* reverseList(ListNode* head) {
    ListNode *prev = NULL;
    while (head != NULL) {
        ListNode *next = head->next;
        head->next = prev;
        prev = head;
        head = next;
    }
    return prev;
}

int main() {
    ListNode *head = (ListNode*)malloc(sizeof(ListNode));
    head->val = 1;
    head->next = (ListNode*)malloc(sizeof(ListNode));
    head->next->val = 2;
    head->next->next = (ListNode*)malloc(sizeof(ListNode));
    head->next->next->val = 3;
    head->next->next->next = NULL;
    
    printf("Original list: ");
    ListNode *curr = head;
    while (curr != NULL) {
        printf("%d ", curr->val);
        curr = curr->next;
    }
    printf("\n");

    head = reverseList(head);
    
    printf("Reversed list: ");
    curr = head;
    while (curr != NULL) {
        printf("%d ", curr->val);
        curr = curr->next;
    }
    printf("\n");
    
    return 0;
}

该算法与前面的算法类似，但是将while循环的条件从curr != NULL改为了head != NULL，这样可以省去curr指针，使代码更加简洁。