C语言代码解决问题

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

typedef struct linkednode

{

    int data;

    struct linkednode* next;

}Linkedstack;

Linkedstack* init_linkedstack()

{

    Linkedstack* top;

    top = (Linkedstack*)malloc(sizeof(Linkedstack));

    if (top != NULL)

        top->next = NULL;

    return top;

}

int Push_linkedstack(Linkedstack* top,int x)

{

    Linkedstack* node = (Linkedstack*)malloc(sizeof(Linkedstack));

    if (node == NULL)

        return 0;

    else

    {

        node->data = x;

        node->next = top->next;

        top->next = node;

        return 1;

    }

}

void conversion(Linkedstack* top, int n)

{

    while (n > 0)

    {

        Push_linkedstack(top, n % 8);

        n /= 8;

    }

    Linkedstack* node = top->next;

    while (node != NULL)

    {

        printf("%d", node->data);

        node = node->next;

    }

    printf("\n");

}

int main()

{

    int n;

    while (scanf("%d", &n) != EOF)

    {

        Linkedstack* top = init_linkedstack();

        conversion(top, n);

        Linkedstack* temp = top->next,*node;

        while (temp != NULL)

        {

            node = temp->next;

            free(temp);

            temp = node;

        }

        free(top);

    }

    return 0;

}