数据结构--栈

栈 ： 后进先出
实现代码如下所示：
#define MYERROR -1
typedef char ElemType;
typedef struct {
int top;
int stackSize;
ElemType *data;
} myStack;

myStack* StackInit(int stackSize)
{
if (stackSize <= 0) {
return NULL;
}
myStack *res = malloc(sizeof(myStack));
if (res == NULL) {
return NULL;
}
res->top = 0;
res->stackSize = stackSize;
res->data = malloc(stackSize * sizeof(ElemType));
if (res->data == NULL) {
free(res);
return NULL;
}
return res;
}
bool StackIsEmpty(myStack *stack)
{
if (stack == NULL) {
return true;
}
return stack->top == 0;
}
int pushStack(myStack *stack, ElemType elemt)
{
if (stack == NULL) {
return MYERROR;
}
if (stack->top == stack->stackSize) {
stack->data = realloc(stack->data, (stack->stackSize + 1) * sizeof(ElemType));
if (stack->data == NULL) {
return MYERROR;
}
stack->stackSize++;
}
stack->data[stack->top] = elemt;
stack->top++;
return 0;
}

ElemType popStack(myStack *stack)
{
stack->top–;
return stack->data[stack->top];
}

void DestroyStack(myStack *stack)
{
if (stack == NULL) {
return;
}
if (stack->data != NULL) {
free(stack->data);
}
free(stack);
}

ElemType GetStackTop(myStack *stack)
{
return stack->data[stack->top - 1];
}

739、每日温度
利用单调栈，单调栈里记录第几天即温度下标i，每次插入新的温度时，把小于当前温度的所有温度压出栈，并且记录距离天数。