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

typedef struct NODE
{
    char data;
    struct NODE *next;
}NODE;

NODE *push_stack(NODE *head);
void free_space(NODE *p);


int main()
{
    NODE *head = NULL,*p = NULL;//链表都要有头结点 和头指针

    p = push_stack(head);

    while(p)
    {
        putchar(p->data);
        p = p->next;
    }

    putchar(10);

    free_space(p);

    return 0;
}

NODE *push_stack(NODE *head)
{
    char string;
    NODE *stack = NULL;

    while(1)
    {
        string = getchar();
        if(string == '\0')
            break;
        stack = (NODE *)malloc(sizeof(struct NODE));//倒叙插入法  栈特性
        stack->data = string;
        stack->next = head;
        head = stack;
    }
    return head;
}

void free_space(NODE *p)//直接递归释放就可以了
{
    if(p->next)
        free_space(p->next);
    free(p);
}

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

typedef struct node NODE, * PNODE;

struct node {
    char  value;
    PNODE pNext;
};


PNODE  init_stack(void);                // 初始化Stack，成功初始化反回栈顶指针，否则返回NULL
void   destroy_stack(PNODE pHead);      // 销毁Stack，需要提供一个栈顶指针。
int    push(PNODE pHead, char value);   // 压栈函数，需要提供一个栈顶指针、一个值，成功压栈返回1，否则返回0
char * pop(PNODE pHead, char * pValue); // 出栈函数，需要提供一个栈顶指针、一个存放值变量的地址，成功出栈返回pValue，否则返回NULL

int main(void) {
    PNODE  pHead = init_stack();
    char * str = "abcdefghijklmnopqrstuvwxyz";
    char * pStr = str;
    char   value;

    while(*pStr)
        push(pHead, *pStr++);

    while(pop(pHead, &value) != NULL)
        printf("%c", value);

    printf("\n");
    destroy_stack(pHead);
    return 0;
}

PNODE init_stack(void) {
    PNODE pHead = (PNODE)malloc(sizeof(NODE));

    pHead->pNext = NULL;

    return pHead;
}

void destroy_stack(PNODE pHead) {
    PNODE temp;  /*
    char  value; */

    while(pHead->pNext != NULL) {
        temp = pHead->pNext->pNext;
        free(pHead->pNext);
        pHead->pNext = temp;
    }

/*
    while(pop(pHead, &value) != NULL)
        ;
*/
    free(pHead);
}

int push(PNODE pHead, char value) {
    PNODE newNode = (PNODE)malloc(sizeof(NODE));

    if(newNode == NULL)
        return 0;

    newNode->value = value;
    newNode->pNext = pHead->pNext;
    pHead->pNext = newNode;

    return 1;
}

char * pop(PNODE pHead, char * pValue) {
    PNODE temp;

    if(pHead->pNext == NULL)
        return NULL;

    *pValue = pHead->pNext->value;
    temp = pHead->pNext->pNext;
    free(pHead->pNext);
    pHead->pNext = temp;

    return pValue;
}

[ 本帖最后由 lz1091914999 于 2011-7-28 00:39 编辑 ]

#include <stdio.h>

void reverse_output(char * pStr) {
    if(*pStr) {
        reverse_output(pStr + 1);
        printf("%c", *pStr);
    }
}

int main(void) {
    char * str = "abcdefghijklmnopqrstuvwxyz";
    reverse_output(str);
    return 0;
}

sacnf("%s",str);
printf("%s",strrev(str));

        char s[100];
    int i;
    scanf("%s",s);
    for(i=strlen(s)-1;i>=0;i--)
        printf("%c\n",s[i]);