课程: Java Algorithms

今天就学习课程吧！

今天就开通帐号，24,700 门业界名师课程任您挑！

Stack algorithms: Matching parentheses

Stack algorithms: Matching parentheses - Java教程

课程: Java Algorithms

开始一个月试用 购买团队方案

Stack algorithms: Matching parentheses

“

- [Instructor] The stack data structure can be a very useful tool when solving software problems that require keeping track of state. Let's say we need to determine whether a given piece of text has matching parentheses. These are some examples where the parentheses are matching. For each of these, the opening symbol comes before the closing symbol and every open symbol has an associated closed symbol. These are some examples where the parentheses are not matching. These do not start with the opening block symbol, or do not have a closing symbol for each opening. We can use the stack data structure to keep track of whether we've seen an opening symbol or not. Let's take a look. Here, we have a function that returns true or false, depending on whether the parentheses are matching. We also have some test cases written for us. The first four should return true, because they have matching parentheses. The others should return false, because they do not have matching parentheses. For the…

内容