fork download

copy

typedef struct {
    int data[100001];
    int front;
    int rear;
} MyStack;
 
/** Initialize your data structure here. */
 
MyStack* myStackCreate() {
    MyStack * node= (MyStack *) malloc(sizeof(MyStack));
        node->rear=-1;
    node->front=0;
        return node;
}
 
/** Push element x onto stack. */
void myStackPush(MyStack* obj, int x) {
 
  obj->rear+=1;
  obj->data[obj->rear]=x;
//printf("push New front = %d , rear = %d\n",obj->front,obj->rear);
}
 
/** Removes the element on top of the stack and returns that element. */
int myStackPop(MyStack* obj) {
    int val;
    if(obj->rear>0)
    {
  MyStack *s2=myStackCreate();
  while(obj->front<obj->rear)
  {
      myStackPush(s2,obj->data[obj->front]);
      obj->front+=1;
  }
    val=obj->data[obj->rear];
        obj=s2;
    //printf("pop New front = %d , rear = %d\n",obj->front,obj->rear);    
    }
    else
    {
        val=obj->data[obj->rear];
        obj->rear=-1;
    }
    return val;
}
 
/** Get the top element. */
int myStackTop(MyStack* obj) {
//  printf(" New front = %d , rear = %d\n",obj->front,obj->rear); 
  int val= obj->data[obj->rear];
    return val;
}
 
/** Returns whether the stack is empty. */
bool myStackEmpty(MyStack* obj) {
  if (obj->front>obj->rear)
      return true;
    else 
        return false;
}
 
void myStackFree(MyStack* obj) {
    obj=NULL;
}
 
/**
 * Your MyStack struct will be instantiated and called as such:
 * MyStack* obj = myStackCreate();
 * myStackPush(obj, x);
 
 * int param_2 = myStackPop(obj);
 
 * int param_3 = myStackTop(obj);
 
 * bool param_4 = myStackEmpty(obj);
 
 * myStackFree(obj);
*/

prog.c: In function ‘myStackCreate’:
prog.c:10:33: warning: implicit declaration of function ‘malloc’ [-Wimplicit-function-declaration]
     MyStack * node= (MyStack *) malloc(sizeof(MyStack));
                                 ^~~~~~
prog.c:10:33: warning: incompatible implicit declaration of built-in function ‘malloc’
prog.c:10:33: note: include ‘<stdlib.h>’ or provide a declaration of ‘malloc’
prog.c:1:1:
+#include <stdlib.h>
 typedef struct {
prog.c:10:33:
     MyStack * node= (MyStack *) malloc(sizeof(MyStack));
                                 ^~~~~~
prog.c: At top level:
prog.c:55:1: error: unknown type name ‘bool’; did you mean ‘_Bool’?
 bool myStackEmpty(MyStack* obj) {
 ^~~~
 _Bool
prog.c: In function ‘myStackEmpty’:
prog.c:57:14: error: ‘true’ undeclared (first use in this function)
       return true;
              ^~~~
prog.c:57:14: note: each undeclared identifier is reported only once for each function it appears in
prog.c:59:16: error: ‘false’ undeclared (first use in this function)
         return false;
                ^~~~~
prog.c: In function ‘myStackFree’:
prog.c:63:9: error: ‘NULL’ undeclared (first use in this function)
     obj=NULL;
         ^~~~
prog.c:63:9: note: ‘NULL’ is defined in header ‘<stddef.h>’; did you forget to ‘#include <stddef.h>’?
prog.c:1:1:
+#include <stddef.h>
 typedef struct {
prog.c:63:9:
     obj=NULL;
         ^~~~
prog.c: In function ‘myStackEmpty’:
prog.c:60:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Standard output is empty