#include "stdio.h"
#include "malloc.h"

struct number
{
    int num;
    struct number *next;
};
struct number *head, *p, *r, *newhead;

main()
{
    int n=0;

    newhead=p=r=head=(struct number *)malloc(sizeof(struct number));
    newhead=NULL;
    while(n<10)
    {
        p=(struct number *)malloc(sizeof(struct number));/*建立链表*/
        printf("Enter the number:");
        scanf("%d", &p->num);
        if (head == NULL)
            head=p;
        else
            r->next=p;
        r=p;
        n++;
    }
    r->next=NULL;
    p=head->next;
    do
    {
        printf("%4d", p->num);/*输出链表*/
        p=p->next;
    }while(p->next != NULL);
    printf("%4d", p->num);

    p=r=head;
    for(n=0; n<10; n++)/*逆置链表*/
    {
        p=p->next;
        r=p;
        if (newhead == NULL)
            {
                newhead->next=r;
                r->next=head;
            }
        else
            {
                r->next=newhead->next;
                newhead->next=r;
            }
    }
    for(p=newhead->next,n=0; n<10; p=p->next,n++)
    {
        printf("%4d", p->num);
    }
    getch();
}

收到的鲜花

• Devil_W 于 2011-06-17 13:11 送鲜花  -3朵   附言：最经典的，显然是用递归写。

如果是逆序建立的  把链表的结点再插入一遍就行了

    
// 经修改，测试通过

#include <stdio.h>
#include <stdlib.h>  
#include "malloc.h" // 如果你的编译器需要这个，那就加上吧

struct number {
    int num;
    struct number *next;
};

int main(void)
{
    int n = 0;
    
    struct number *head, *p, *r, *newnode;
    
    p = r = head = NULL;

    /* 建立链表 */
    head = NULL;
    printf("Enter 10 number: ");
    for (n = 0; n < 10; ++n) {
        
        newnode = (struct number *)malloc(sizeof(struct number));
        if (newnode == NULL) {
            printf("Error: Memory Full!\n");
            system("pause");
            exit(1);
        }
        newnode->next = NULL;
        
        scanf("%d", &newnode->num);
        if (head == NULL)
            head = r = newnode;
        else
            r->next = newnode;
        
        r = newnode;
    }
    /* newnode->next = NULL; */
    
    /* 输出链表 */
    for (p = head; p != NULL; p = p->next)
        printf("%4d", p->num);
    printf("\n\n");
    
    /* 逆置链表 */
    p = head;
    head = r = NULL;
    while (p != NULL) {
        if (head == NULL) {
            head = p;
            p = p->next;
            head->next = NULL;
        }
        else {
            r = p->next;
            p->next = head;
            head = p;
            p = r;
        }
    }
    
    /* 输出链表 */
    for (p = head; p != NULL; p = p->next)
        printf("%4d", p->num);
    printf("\n\n");
    
    system("pause");
    return 0;
}

[ 本帖最后由 cosdos 于 2011-6-16 23:03 编辑 ]

#include <stdio.h>
#include <malloc.h>

typedef struct number {
    int num;
    struct number * next;
} node;

typedef struct {
    node * head;
    node * first;
    node * last;
} list;

int init_list(list * l) {
    if (!l) {
        return 1;
    }
    l->head = (node *) malloc(sizeof(node));
    if (!l->head) {
        return 1;
    }
    l->head->next = l->first = l->last = NULL;
    return 0;
}

void insert_first(list * l, node * n) {
    n->next = l->first;
    l->first = l->head->next = n;
    if (!l->last) {
        l->last = l->first;
    }
}

void append(list * l, node * n) {
    n->next = NULL;
    if (l->last) {
        l->last->next = n;
        l->last = n;
    } else {
        l->head->next = l->first = l->last = n;
    }
}

int main() {
    int n;
    node * p = NULL, * q = NULL;
    list l, l_reverse;
    
    printf("How many numbers do you want to put into the list? ");
    scanf("%d", &n);
    
    if (init_list(&l)) {
        printf("Failed to allocate memory.");
        return 1;
    }
    while (n--) {
        p = (node *) malloc(sizeof(node));
        if (!p) {
            printf("Failed to allocate memory.");
            return 1;
        }
        scanf("%d", &p->num);
        append(&l, p);
    }
    
    p = l.first;
    while (p) {
        printf("%d ", p->num);
        fflush(stdout);
        p = p->next;
    }
    printf("\n");
    
    if (init_list(&l_reverse)) {
        printf("Failed to allocate memory.");
        return 1;
    }
    p = l.first;
    while (p) {
        q = p->next;
        insert_first(&l_reverse, p);
        p = q;
    }
    
    p = l_reverse.first;
    while (p) {
        printf("%d ", p->num);
        p = p->next;
    }
    
    return 0;
}

ps：这样进行逆序后，链表 l 的结构就被破坏掉了

[ 本帖最后由 voidx 于 2011-6-16 23:12 编辑 ]

exit(1)是神马意思？