mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 21:46:29 +08:00
79 lines
1.3 KiB
Ruby
79 lines
1.3 KiB
Ruby
|
=begin
|
||
|
File: array_stack.rb
|
||
|
Created Time: 2024-04-06
|
||
|
Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
|
||
|
=end
|
||
|
|
||
|
### 基於陣列實現的堆疊 ###
|
||
|
class ArrayStack
|
||
|
### 建構子 ###
|
||
|
def initialize
|
||
|
@stack = []
|
||
|
end
|
||
|
|
||
|
### 獲取堆疊的長度 ###
|
||
|
def size
|
||
|
@stack.length
|
||
|
end
|
||
|
|
||
|
### 判斷堆疊是否為空 ###
|
||
|
def is_empty?
|
||
|
@stack.empty?
|
||
|
end
|
||
|
|
||
|
### 入堆疊 ###
|
||
|
def push(item)
|
||
|
@stack << item
|
||
|
end
|
||
|
|
||
|
### 出堆疊 ###
|
||
|
def pop
|
||
|
raise IndexError, '堆疊為空' if is_empty?
|
||
|
|
||
|
@stack.pop
|
||
|
end
|
||
|
|
||
|
### 訪問堆疊頂元素 ###
|
||
|
def peek
|
||
|
raise IndexError, '堆疊為空' if is_empty?
|
||
|
|
||
|
@stack.last
|
||
|
end
|
||
|
|
||
|
### 返回串列用於列印 ###
|
||
|
def to_array
|
||
|
@stack
|
||
|
end
|
||
|
end
|
||
|
|
||
|
### Driver Code ###
|
||
|
if __FILE__ == $0
|
||
|
# 初始化堆疊
|
||
|
stack = ArrayStack.new
|
||
|
|
||
|
# 元素入堆疊
|
||
|
stack.push(1)
|
||
|
stack.push(3)
|
||
|
stack.push(2)
|
||
|
stack.push(5)
|
||
|
stack.push(4)
|
||
|
puts "堆疊 stack = #{stack.to_array}"
|
||
|
|
||
|
# 訪問堆疊頂元素
|
||
|
peek = stack.peek
|
||
|
puts "堆疊頂元素 peek = #{peek}"
|
||
|
|
||
|
# 元素出堆疊
|
||
|
pop = stack.pop
|
||
|
puts "出堆疊元素 pop = #{pop}"
|
||
|
puts "出堆疊後 stack = #{stack.to_array}"
|
||
|
|
||
|
# 獲取堆疊的長度
|
||
|
size = stack.size
|
||
|
puts "堆疊的長度 size = #{size}"
|
||
|
|
||
|
# 判斷是否為空
|
||
|
is_empty = stack.is_empty?
|
||
|
puts "堆疊是否為空 = #{is_empty}"
|
||
|
end
|