-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.cpp
More file actions
93 lines (72 loc) · 952 Bytes
/
Stack.cpp
File metadata and controls
93 lines (72 loc) · 952 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
* 使用正向链表
* 和反向链表和动态数组来实现一个栈
* @author : light
* E-mail: zhilight@gmail.com
*
* */
#include <iostream>
using namespace std;
struct node
{
int data;
node *next;
}
class Stack
{
public:
Stack();
bool pop();
int top() const;
bool push(const int data);
int size() const;
~Stack();
private:
node *p_top;
node *p_bottom;
node *cur;
int size;
}
Stack::Stack()
{
p_top = p_bottom = NULL;
size = 0;
}
int Stack::push(const int data)
{
node *temp;
if (size == 0)
{
temp = new node;
temp->data = data;
p_bottom = temp;
p_top = temp;
cur = temp;
cur->next = NULL;
++size;
}
else
{
temp = new node;
node->data = data;
p_top = temp;
cur->next = temp;
cur = cur->next;
cur->next = NULL;
}
}
int Stack::top() const
{
return p_top->data;
}
int Stack::size() const
{
return size;
}
Stack::~Stack()
{
while ()
}
bool Stack::pop()
{
}