我的题目是：用链栈实现将十进制数转化为八进制数，我编完了，可我不会改啊，都改了无数个日夜了，还是改不好。有哪位好心的人能帮帮我啊？将不胜感激啊！。程序就在下面，帮帮忙，救救我吧，交不上程序我就挂了啊。呜呜呜呜呜，要求输入11输出13
#include<stdio.h>
#include<math.h>
typedef struct node
{
    int data;
    struct node *next;
}LinkStack;
void init_stack(LinkStack *top)
{
    top->data='-1';
    top->next=NULL;
}
int decide_empty(LinkStack  *top)
{
    if(top->data=='-1')
        return (1);
    else
        return (0);
}
LinkStack* Enter_stack(LinkStack *top,int x)
{
    top=(LinkStack*)malloc(sizeof(LinkStack));
    top->data=x;
    top->next=NULL;

    top=top->next;
    printf("\nOK!\n");
    return(top);
}
int del_stack(LinkStack *top )
{
    LinkStack *p;
    int a;
    if(top==NULL)
    {
        printf("\n栈为空!");
        return 0;
    }
    else
    {
        a=top->data;
        p=top;
        top=top->next;
        free(p);
        return a;
    }
}

main()
{
    LinkStack LS,*L=&LS;
    int n,e;
    init_stack(L);
    printf("please input a decimal number:");
    scanf("%d",&n);
    if(n<=0)
    printf("error due to the wrong input!\n");
    while(n)
    {
        Enter_stack( L ,n%8);
        n=n/8;
    }
    printf("the changed number is:\n");
    while(decide_empty(L))
    {
        e=del_stack(L);
        printf("\t%d",e);
    }
    getch();
}

我有空就帮你看看。。。。。

[[it] 本帖最后由 布拉莫斯 于 2008-4-21 23:25 编辑 [/it]]

#include <stdlib.h>

#define TRUE 1
#define FALSE 0
#define NULL 0

typedef int ElementType;
typedef struct node ...{
    ElementType data;
    struct node *next;
}StackNode, *LinkStack;

void InitStack(LinkStack top) ...{
    top->next = NULL;
}

int IsEmpty(LinkStack top) ...{
    if(top->next == NULL) return TRUE;
    return FALSE;
}

int Push(LinkStack top, ElementType element) ...{
    StackNode *temp;
    temp = (StackNode *)malloc(sizeof(StackNode));
    if(temp == NULL) return FALSE;
    temp->data = element;
    temp->next = top->next;
    top->next = temp;
    return TRUE;
}

int Pop(LinkStack top, ElementType *element) ...{
    if(IsEmpty(top)) return FALSE;
    StackNode *temp = top->next;
    *element = temp->data;
    top->next = temp->next;
    free(temp);
    return TRUE;
}

void GetTop(LinkStack top, ElementType *element)
{
    *element = top->next->data;
}
你可以参考一下，你程序问题不大

你的程序错的确实不多，不过，我改动比较大！
你参考一下吧！
#include<stdio.h>
#include<math.h>
typedef struct node   /*建议用双向链表*/
{
    int data;
    struct node *next;
    struct node *prev;  
}LinkStack;
void init_stack(LinkStack *top)
{
    top->data=-1;
    top->next=NULL;
    top->prev=NULL;
}


LinkStack* Enter_stack(LinkStack *p,int x)
{
    LinkStack *temp;
    temp=(LinkStack *)malloc(sizeof(LinkStack));
    temp->data=x;
    temp->next=NULL;
    temp->prev=p;
    p->next=temp;
    p=temp;
    return p;
}
void del_stack(LinkStack *top )
{
    LinkStack *p;
    int a;
    p=(LinkStack *)malloc(sizeof(LinkStack));
     if(top->prev==NULL)
    {
        printf("\n栈为空!");
        return ;      /*这里就不好区分返回的0是数值0还是代表结束的0*/
    }
    else
    {
        
        while(top->prev!=NULL)
        {
        a=top->data;
        p=top;
        top=top->prev;  /*进行回溯*/
        top->next=NULL;
        printf("%d",a);   /*所以建议一边删除一边输出*/
        free((void*)p);
        }
    }
}

main()
{   
    LinkStack *p;
    int n;
    p=(LinkStack *)malloc(sizeof(LinkStack));
    init_stack(p);
    printf("please input a decimal number:");
    scanf("%d",&n);
    if(n<=0)
    printf("error due to the wrong input!\n");
    while(n)
    {
        p=Enter_stack(p,n%8);
        n=n/8;
    }
    printf("the changed number is: ");
    if(p->prev!=NULL)
        del_stack(p);
    printf("\n");
    getch();
}

vc++ 6.0 下编译通过！