练习7.1-2

最新推荐文章于 2023-08-06 09:53:29 发布

Wake When Septemper

最新推荐文章于 2023-08-06 09:53:29 发布

阅读量242

点赞数

分类专栏： python数据结构文章标签：括号匹配

本文链接：https://blog.csdn.net/liudaoqiang_tj/article/details/82469829

版权

python数据结构专栏收录该内容

23 篇文章 0 订阅

订阅专栏

#! /usr/bin/env python
# -*- coding: utf-8 -*-

'''
@author: liudaoqiang
@file: studycase
@time: 2018/9/2 10:46
'''

from arraystack import LinkedStack

def branketsBalance(exp):
	"""exp is a string that represents the expression"""
	stk = LinkedStack()
	for ch in exp:
		if ch in ['[','(']:
			stk.push(ch)
		elif ch in [']',')']:
			if stk.isEmpty():
				return False
			chFromStack = stk.pop()
			if ch == ']' and chFromStack != ']' or\
				ch == ')' and chFromStack != '(':
				return False
		return stk.isEmpty()

def branketsBalanceExtd(exp, startlyst, endlyst):
	"""exp is a string that represents the expression"""
	stk = LinkedStack()
	for index in range(len(startlyst) - 1):
		if startlyst[index] not in exp:
			return False
		stk.push(startlyst[index])
		if startlyst[index] == endlyst[index]:
			stk.pop()
		else:
			return False
	return stk.isEmpty()

def main():
	exp = input("input bracketed expression")
	if branketsBalance(exp):
		print("OK")
	else:
		print("not OK")

if __name__ == "__main__":
	main()