常用的数据结构实例

1 #define MAXSIZE  10
2 typedef int Emptype;
3 typedef int Decltype;
4 typedef struct node
5 {
6     Decltype data[MAXSIZE];
7     int top;
8 }SeqStack ,*Stack;
9 SeqStack *s;  //定义顺序栈指针

1 SeqStack *Init_SeqStac()
2 {
3     SeqStack *s;
4     s = (Stack)malloc(sizeof(SeqStack));
5     s->top = -1;
6     return s;
7 }

1  int Empty_SeqStack(SeqStack *s)
2  {
3      if (s->top == -1) return 1;
4      else return 0;
5  }

 1 int Push_SeqStack(SeqStack *s, Decltype x)
 2 {
 3     if (s->top == MAXSIZE - 1) 
 4         return 0;
 5     else
 6     {
 7         s->top++;
 8         s->data[s->top] = x;
 9         return 1;
10     }
11 }

 1 int Pop_SeqStack(SeqStack *s, Decltype *x)
 2 {
 3     if (Empty_SeqStack(s))
 4         return 0;
 5     else
 6     {
 7         *x = s->data[s->top];
 8         s->top--;
 9         return 1;
10     }
11 }

1 Decltype Top_SeqStack(SeqStack *s)
2 {
3     if (Empty_SeqStack(s))
4     return 0;
5     else
6         return (s->data[s->top]);
7 
8 }

 1 typedef struct
 2 {
 3     Emptype stack][MAXSIZE];
 4     int lefttop;  //左栈栈定位置
 5     int righttop;  //右栈栈顶位置
 6 }dupsqstack;
 7 
 8 //设定左右栈标志
 9 char status;
10 status = 'L';
11 status = 'R';

1 1 s->lefttop + 1 == s->righttop;

1 int initDupStack(dupsqstack *s)
2 {
3     if ((s = (dupsqstack*)malloc(sizeof(dupsqstack))) == NULL)
4         return false;
5     s->lefttop - 1;
6     s->righttop = MAXSIZE
7         return true;
8 }

 1 int pushDupsqstack(dupsqstack *s, char status, Emptype x)
 2 {
 3     //把数据元素x压入左栈或右栈
 4     if (s->lefttop + 1 == s->righttop)
 5         return false;
 6     if (status = 'L')
 7         s->stack[++s->righttop] = x;
 8     else if (status = 'R')
 9         s->stack[--s->lefttop] = x;
10     else return false;
11     return true;
12 }

 1 Emptype popDupsqstack(dupsqstack *s, char status)
 2 {
 3     //从左栈或右栈栈顶退出元素
 4     if (status = 'L')
 5     {
 6         if (s->lefttop < 0)
 7             return NULL;
 8         else return (s->stack[s->lefttop--]);
 9     }
10     else if (status = 'R')
11     {
12         if (s->righttop >MAXSIZE-1)
13             return NULL;
14         else return (s->stack[s->righttop++]);
15     }
16     else return NULL;
17 }

package com.test;
/**
 * @author Administrator
 * @param <T>
 * 在java中，用数组表示栈
 */
public class SqStack<T> {
    private T data[];  //栈
    private int top;   //栈顶指针,也是数组下标
    private int maxSize; //栈的大小，也是数组的大小
    
    //初始化栈
    public SqStack(int maxSize){
        this.maxSize = maxSize;
        this.top = -1;   
        this.data = (T[]) new Object[maxSize];
    }
    
    //1.判栈空，如果站顶指针还不是数组下标中的一个，则为空
    public boolean isNull(){
        if(this.top < 0){
            return true;
        }else{
            return false;
        }
    }
    //2.判栈满,如果站顶指针达到数组最大值，则为满
    public boolean isFull(){
        if(this.top == this.maxSize - 1){
            return true;
        }else{
            return false;
        }
    }
    //3.入栈,给数组中加入元素
    public boolean push(T value){
        if(isFull()){
            return false;
        }else{
            data[++top] = value;
            return true;
        }
    }
    
    //4.出栈
    public T Pop(){
        if(isNull()){
            return null;
        }else{
            T value = data[this.top];
            --this.top;
            return value;
        }
    }
    
}