Python实现括弧匹配算法

from pythonds.basic.stack import Stack
# 算法一实现括弧匹配,利用栈来实现
def parCheck(symbolString):
	s = Stack()
	balanced = True
	index = 0

	while index < len(symbolString) and balanced:
		symbol = symbolString[index]
		if symbol == '(':
			s.push(symbol)
		else:
			if s.isEmpty():
				balanced = False
			else:
				s.pop()

		index += 1

	if balanced and s.isEmpty():
		return True
	else:
		return False

def match(open, close):
	opens = "([{"
	closers = ")]}"
	return opens.index(open) == closers.index(close)
# 算法二实现( 【 { } 】 )都能进行匹配
def parCheck2(symbolString):
	s = Stack()
	balanced = True
	index = 0

	while index < len(symbolString) and balanced:
		symbol = symbolString[index]
		if symbol in '([{':
			s.push(symbol)
		else:
			if s.isEmpty():
				balanced = False
			else:
				top = s.pop()
				if not match(top, symbol):
					balanced = False

		index += 1

	if balanced and s.isEmpty():
		return True
	else:
		return False

if __name__ == '__main__':

	s = Stack()
	print(s.isEmpty())
	s.push(4)
	s.push('dog')
	print(s.peek())
	s.push(True)
	print(s.size())
	print(s.isEmpty())
	s.push(8.4)
	print(s.pop())
	print(s.pop())
	print(s.size())

	print('--------------------------')

	print(parCheck('(((())))'))
	print(parCheck2('(((([]))))'))

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值