stack erase
stack<int> stk;
stk.push(5);
int ans = stk.top(5); // ans =5
stk.pop();//removes 5
0
0
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
main() {
struct node {
int data;
struct node *next;
}*pNew,*dltPtr;
struct stack_ptr {
int count;
struct node *top;
}*stack;
int i;
scanf("%d",&i);
pNew = new node;
pNew->data = i;
pNew->next = NULL;
stack = new stack_ptr;
stack->count = 1;
stack->top = pNew;
scanf("%d",&i);
while (i != 0){
pNew = new node;
pNew->data = i;
pNew->next = stack->top;
stack->count++;
stack->top = pNew;
scanf("%d",&i);
}
dltPtr = stack->top;
while (dltPtr != NULL) {
printf("% d",dltPtr->data);
dltPtr = dltPtr->next;
}
}
Thank you!
0
0
Are there any code examples left?
New code examples in category C++
-
C++ 2023-04-28 17:44:25
-
C++ 2022-03-27 19:20:39 lists occurrences of characters in the string c++
-
C++ 2022-03-27 18:00:14 variabili in c++
-
C++ 2022-03-27 17:10:08 repeat character n times c++
-
C++ 2022-03-27 15:50:07 delete an array c++
-
C++ 2022-03-27 15:40:12 C++ pointer to base class
-
C++ 2022-03-27 12:15:21 find the graph is minimal spanig tree or not
-
C++ 2022-03-27 11:30:15 multi variable assignment cpp
-
C++ 2022-03-27 11:05:17 c++ pi float
-
C++ 2022-03-27 10:20:12 why exceptions can lead to memory leaks