-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleetcode_232.cpp
121 lines (100 loc) · 2.06 KB
/
leetcode_232.cpp
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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
/*
* =========================================================================
*
* FileName: leetcode_232.cpp
*
* Description:
*
* Version: 1.0
* Created: 2018-11-21 16:21:23
* Last Modified: 2018-11-21 16:21:52
* Revision: none
* Compiler: gcc
*
* Author: zt ()
* Organization:
*
* =========================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stddef.h>
#include <string.h>
#include <signal.h>
#include <errno.h>
#include <unistd.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/socket.h>
#include <iostream>
#include <memory>
#include <algorithm>
#include <vector>
#include <thread>
#include <mutex>
#include <map>
#include <list>
#include <string>
#include <functional>
#include <stack>
using namespace std;
class MyQueue
{
public:
/** Initialize your data structure here. */
MyQueue()
{
}
/** Push element x to the back of queue. */
void push ( int x )
{
m_stack.push ( x );
}
/** Removes the element from in front of queue and returns that element. */
int pop()
{
while ( !m_stack.empty() )
{
m_stack_b.push ( m_stack.top() );
m_stack.pop();
}
int ret = m_stack_b.top();
m_stack_b.pop();
while ( !m_stack_b.empty() )
{
m_stack.push ( m_stack_b.top() );
m_stack_b.pop();
}
return ret;
}
/** Get the front element. */
int peek()
{
while ( !m_stack.empty() )
{
m_stack_b.push ( m_stack.top() );
m_stack.pop();
}
int ret = m_stack_b.top();
while ( !m_stack_b.empty() )
{
m_stack.push ( m_stack_b.top() );
m_stack_b.pop();
}
return ret;
}
/** Returns whether the queue is empty. */
bool empty()
{
return m_stack.empty();
}
stack<int> m_stack;
stack<int> m_stack_b;
};
int main ( int argc, char* argv[] )
{
( void ) argc;
( void ) argv;
return 0;
}