栈-C语言及Python实现

#include<stdio.h>
typedef struct Stack
{
  int data;
  struct Stack* next;
}Stack;
Stack* CreateStack()    //创建栈
{
  Stack* stack = (Stack*)malloc(sizeof(Stack));
  stack->next = NULL;
  return stack;
}
void push_stack(Stack* stack,int data) //入栈
{
  Stack* news = (Stack*)malloc(sizeof(Stack));
  news->data = data;
  news->next = stack->next;
  stack->next = news;
  return;
}
void pop_stack(Stack* stack)    //出栈
{
  Stack* temp;
  if (stack->next != NULL)
  {
    temp = stack->next;
    stack->next = temp->next;
  }
}
int get_top(Stack* stack)    //得到栈顶元素
{
  if (stack->next != NULL)
    return stack->next->data;
  return -1;
}
int empty(Stack* stack)   //判断栈是否为空
{
  if (stack->next != NULL)
    return 0;
  return 1;
}
void to_empty(Stack* stack)   //清空栈
{
  Stack* temp;
  while (stack->next != NULL)
  {
    temp = stack->next;
    stack->next = temp->next;
  }
}

class stack:
  def __init__(self):
    self.stack = []
    self.right = 0
  def push_stack(self,data):
    self.stack.append(data)
    self.right+=1
    return self.stack
  def pop_stack(self):
    self.stack.pop()
    self.right -=1
    return self.stack
  def get_top(self):
    return self.stack[self.right-1]
  def is_empty(self):
    if self.right == 0:
      return True
    else:
      return False