线性表之栈

栈的原理

• 栈是限制在一端进行插入操作和删除操作的线性表（俗称堆栈）
• 允许进行操作的一端称为“栈顶”
• 另一固定端称为“栈底”
• 当栈中没有元素时称为“空栈”。特点 ：后进先出（LIFO）。

顺序栈的实现（C语言）

顺序栈结构体

typedef struct {
	data_t *data;
	int maxlen;
	int top;
}sqstack;

创建栈

sqstack * stack_create(int len) {
	sqstack * s;

    if ((s =(sqstack *)malloc(sizeof(sqstack))) == NULL) {
        printf("malloc sqstack failed\n");
        return NULL;
    }

    if ((s->data = (data_t *)malloc(len * sizeof(data_t)))==NULL) {
        printf("malloc data failed\n");
        free(s);
        return NULL;
    }

    memset(s->data, 0, len*sizeof(data_t));
    s->maxlen = len;
    s->top = -1;

    return s;
}

入栈

int stack_push(sqstack * s, data_t value) {
	if (s == NULL) {
		printf("s is NULL\n");
		return -1;
	}

    if (s->top == s->maxlen-1) {
        printf("stack is full\n");
        return -1;
    }

    s->top++;
    s->data[s->top] = value;

    return 0;
}

出栈

data_t stack_pop(sqstack *s) {
	s->top--;
	return (s->data[s->top+1]);
}

判断栈是否满

/*
 *@ret 1-empty
 * */
   int stack_empty(sqstack *s) {
   if (s == NULL) {
   	printf("s is NULL\n");
   	return -1;
   }
   return (s->top == -1 ? 1 : 0);
}

判断栈是否空

/*
 * @ret 1-full
 * */
   int stack_full(sqstack *s) {
   if (s == NULL) {
   	printf("s is NULL\n");
   	return -1;
   }
   return  (s->top == s->maxlen-1 ? 1 : 0);
   }

返回栈顶元素

data_t stack_top(sqstack *s) {
	return (s->data[s->top]);
}

清空栈

int stack_clear(sqstack *s) {
	if (s == NULL) {
		printf("s is NULL\n");
		return -1;
	}
	
    s->top = -1;
    return 0;
}

删除栈

int stack_free(sqstack *s) {
	if (s == NULL) {
		printf("s is NULL\n");
		return -1;
	}
	
    if (s->data != NULL) 
        free(s->data);
    free(s);

    return 0;
}

链式栈的实现（C语言）

链式栈结构体

与链表结构体一样

typedef int data_t;

typedef struct node {
	data_t data;
	struct node *next;
}listnode, *linkstack;

创建栈

linkstack stack_create() {
	linkstack s;

    s = (linkstack)malloc(sizeof(listnode));
    if (s == NULL) {
        printf("malloc failed\n");
        return NULL;
    }
    s->data = 0;
    s->next = NULL;

    return s;
}

入栈

int stack_push(linkstack s, data_t value) {
	linkstack p;

    if (s == NULL) {
        printf("s is NULL\n");
        return -1;
    }

    p = (linkstack)malloc(sizeof(listnode));
    if (p == NULL) {
        printf("malloc failed\n");
        return -1;
    }
    p->data = value;
    //p->next = NULL;
    p->next = s->next;
    s->next = p;

    return 0;
}

出栈

data_t stack_pop(linkstack s) {
	linkstack p;
	data_t t;

    p = s->next;
    s->next = p->next;

    t = p->data;

    free(p);
    p =NULL;

    return t;
}

判断栈是否满

int stack_empty(linkstack s) {
	if (s == NULL) {
		printf("s is NULL\n");
		return -1;
	}

	return (s->next == NULL ? 1 : 0);

}

返回栈顶元素

data_t stack_top(linkstack s) {
	return (s->next->data);
}

删除栈

linkstack stack_free(linkstack s) {
	linkstack p;

    if (s == NULL) {
        printf("s is NULL\n");
        return NULL;
    }

    while (s != NULL) {
        p = s;
        s = s->next;
        printf("free:%d\n", p->data);
        free(p);
    }

    return NULL;
}

k s) {
linkstack p;

if (s == NULL) {
    printf("s is NULL\n");
    return NULL;
}

while (s != NULL) {
    p = s;
    s = s->next;
    printf("free:%d\n", p->data);
    free(p);
}

return NULL;

}