2019.07.27

用数组实现栈

#include <stdio.h>
#include <stdlib.h>
#define N 10

struct stack_data
{
    int stack[N];
    int top;
};

typedef struct stack_data Stack;

void create_stack(Stack **stack)
{
    *stack = (Stack*)malloc(sizeof(Stack));
    if(*stack == NULL)
    {
        printf("malloc error!\n");
        exit(-1);
    }
}

void init_stack(Stack *stack)
{
    stack->top = -1;
}

enum return_val{PUSH_OK = 100,PUSH_NO,POP_OK,POP_NO,FULL_OK,FULL_NO,EMPTY_OK,EMPTY_NO};

int is_full(Stack *stack)
{
    if(stack->top == N-1)
    {
        return FULL_OK;
    }
    return FULL_NO;
}

int push_stack(Stack *stack,int num)
{
    if(is_full(stack) == FULL_OK)
    {
        printf("stack is full!\n");
        return PUSH_NO;
    }
    else
    {
        stack->top++;
        stack->stack[stack->top] = num;
        return PUSH_OK;
    }
}

int is_empty(Stack *stack)
{
    if(stack->top == -1)
    {
        return EMPTY_OK;
    }
    else
    {
        return EMPTY_NO;
    }
}

int pop_stack(Stack *stack)
{
    if(is_empty(stack) == EMPTY_OK)
    {
        printf("stack is empty!\n");
        return POP_NO;
    }
    else
    {
        return stack->stack[stack->top--];
    }
}


int main()
{
    int i;
    int ret;
    Stack *stack;

    create_stack(&stack);

    init_stack(stack);

    for(i = 0;i < N;i++)
    {
        if(push_stack(stack,i+1) == PUSH_OK)
        {
            printf("push ok!\n");
        }
        else
        {
            printf("push no!\n");
            break;
        }
    }

    for(i = 0;i < N;i++)
    {
        ret = pop_stack(stack);
        if(ret == POP_NO)
        {
            printf("pop failure!\n");
            break;
        }
        else
        {
            printf("num = %d\n",ret);
        }
    }

    return 0;
}

双向循环链表
实现头插，尾插，中间插入，删除节点等功能

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

struct dbl_node
{
    int num;
    struct dbl_node *prior;
    struct dbl_node *next;
};

typedef struct dbl_node Dbl_node;
typedef struct dbl_node *Link;

void is_malloc_ok(Link node)
{
    if(node == NULL)
    {
        printf("malloc error!\n");
        exit(-1);
    }
}

void create_node(Link *node)
{
    *node = (Link)malloc(sizeof(Dbl_node));
    is_malloc_ok(*node);
}

void create_link(Link *head)
{
    create_node(head);
    (*head)->next = (*head)->prior = *head;
}

void insert_node_head(Link head,Link new_node)
{
    new_node->prior = head;
    new_node->next = head->next;
    head->next = new_node;
    new_node->next->prior = new_node;
}

void insert_node_tail(Link head,Link new_node)
{
   new_node->next = head;
   new_node->prior = head->prior;
   head->prior = new_node;
   new_node->prior->next = new_node;
}

void insert_node_mid_behind(Link head,Link new_node,int loc)
{
    Link p;

    p = head;

    while(p->next != head && p->num != loc)
    {
        p = p->next;
    }
        
    new_node->prior = p;
    new_node->next = p->next;
    p->next = new_node;
    new_node->prior->next = new_node;
}

void insert_node_mid_front(Link head,Link new_node,int loc)
{
    Link p;
    p = head;

    while(p->next != head && p->num != loc)
    {
        p = p->next;
    }

    new_node->next = p;
    new_node->prior = p->prior;
    p->prior = new_node;
    new_node->prior->next = new_node;
}

void delete_node(Link head,int del)
{
    Link p;
    p = head->next;

    while( p->num != del)
    {
        p= p->next;
    }
        p->next->prior = p->prior;
        p->prior->next = p->next;
        free(p);
}

/*void find_node(Link head,Link new_node)
{

}*/

void display_link(Link head)
{
    Link p;
    p = head->next;

    if(head == NULL)
    {
        printf("no such link!\n");
        return;
    }
    while(p != head)
    {
        printf("%d\n",p->num);
        p = p->next;
    }
}

int main()
{
    int i;
    Link head = NULL;
    Link new_node = NULL;
    int loc;
    int del;
    int find;

    create_link(&head);

    for(i = 0;i < 10;i++)
    {
        create_node(&new_node);
        new_node->num = i+1;

//        insert_node_head(head,new_node);
        
        insert_node_tail(head,new_node);
        
    }

    display_link(head);

    create_node(&new_node);

    printf("input a number for new_node:");
    scanf("%d",&new_node->num);
    
    printf("input a number for insert location:");
    scanf("%d",&loc);

    insert_node_mid_behind(head,new_node,loc);

   // insert_node_mid_front(head,new_node,loc);

    display_link(head);

    printf("input a number to delete:");
    scanf("%d",&del);

    delete_node(head,del);

    display_link(head);

  //  printf("input a number to find:");
   // scanf("%d",&find);

    //find_node(head,new_node);


    return 0;
}