首页 > 其他 > 详细

[Data Structure] An Algorithm for Matching Delimiters

时间:2018-09-17 13:10:10      阅读:178      评论:0      收藏:0      [点我收藏+]

An important task when processing arithmetic expressions is to mach delimiters.

We can use Stack to solve this problem.

def is_matched(expr):
	left=‘({[‘
	right=‘)}]‘

	S=ArrayStack()

	for c in expr:
		if c in left:
			S.push(c)
		elif c in right:
			if S.is_empty():
				return False
			if right.index(c)!=left.index(S.pop()):
				return False
	return S.is_empty()

  

[Data Structure] An Algorithm for Matching Delimiters

原文:https://www.cnblogs.com/chiyeung/p/9661445.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!