-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.rb
More file actions
78 lines (56 loc) · 1 KB
/
Solution.rb
File metadata and controls
78 lines (56 loc) · 1 KB
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
require 'thread'
require 'queue'
class Stack
# Initialize your data structure here.
def initialize
@quque1 = Queue.new
@queue2 = Queue.new
@top_element = nil
end
# @param {Integer} x
# @return {void}
def push(x)
if self.empty
@queue1.push x
return
end
if @queue1.empty?
@queue1.push x
until @queue2.empty?
@quque1.push @queue2.pop
end
else
@queue2.push x
until @queue1.empty?
@queue2.push @queue1.pop
end
end
end
# @return {void}
def pop
if @top_element.nil?
if @queue1.empty?
@queue2.pop
else
@queue1.pop
end
else
@top_element = nil
end
end
# @return {Integer}
def top
if @top_element.nil?
@top_element = @quque1.empty? ? @queue2.pop : @queue1.pop
end
@top_element
end
# @return {Boolean}
def empty
@quque1.empty? and @queue2.empty?
end
end
stack = Stack.new
stack.push 1
puts stack.top
puts stack.top