stack-- 基于双向链表实现(java实现)--基于数组实现(c实现)

 1 //不考虑任何情况的判断 

　　package cn.it.struct;

public class MyStack<T> {
    private int top=-1;
    
    private Node<T> current;
    
    
    private class Node<T>{
        private T data;
        
        private Node<T> next;
        
        private Node<T> pre;

    }
    
    //初始化
    public MyStack(){
        top = -1;
        current = new Node<T>();
    }
    
    //压Stack
    public boolean push(T data){
        Node<T> node = new Node<T>();
        node.data = data;
        current.next = node;
        current = node.pre;
        current = node;
        top++;
        return false;
    }
    
    //出Stack
    public T poll(){
        T data = current.data;
        current = current.pre;
        top--;
        return data;
    }
}

#include<stdlib.h>
/*
 *
 *        基于arraylist实现
 *
 * */
#define STACK_INIT_SIZE 100

typedef char ele;

typedef struct {
    ele *top;
    ele *base;
    int len;
}stack;

//初始化
void init(stack *s){
    s->base=(ele *)malloc(STACK_INIT_SIZE*sizeof(ele));
    if(!s->base)exit(0);
    s->top=s->base;
    s->len=STACK_INIT_SIZE;
}

//插入
void push(stack *s,ele e){
    if(s->top-s->base>=s->len){
        s->base=realloc(s->base, s->len + 10 *sizeof(ele));
        if(!s->base){
            exit(0);
        }
        *(s->base+s->len+1)=e;
        s->len=10+s->len;
    }else{
        *(s->base+s->len)=e;
    }
    *(s->top)=e;
}

//pop
ele pop(stack *s){
    if(*(s->top)==*(s->base)){return NULL;}
    (s->base+s->len-1)=NULL;
    s->len--;
    return *(s->top);
}