The requirements of reports: 1.The algorithm design idea 2.The source code with necessary comments 3.Test case and results (show the screenshot of your terminal)； 4.Summary 3、Valid Parentheses (Stack)[Solution introduction: the second video in 3.6] [Problem description] Determine whether the parenthesis string is valid. Assume there are two types of parentheses in an expression, i.e., “()”, “[]”. The valid parenthesis string must meet two requirements: 1. Each right parenthesis must match with a left parenthesis. That is to say, ‘(’ must find ‘)’ and ‘[’ must find ‘]’. 2.A left parenthesis appearing first should be match later. A left parenthesis appearing later should be match first. Therefore “([ )]” is not valid and “([ ])” is valid. The maximal length of the parenthesis sequence is 30. [Basic requirements] 1) Use stacks to complete this topic. [Example] Problem: Check whether “[([ ][ ])]” is valid What you need to show in the terminal(the back part is outputted by you and the blue part is inputted by the user, i.e., teacher): Parenthesis string: [([ ][ ])] Yes! Problem: Check whether “(( )[ ]))” is validWhat you need to show in the terminal(the back part is outputted by you and the blue part is inputted by the user, i.e., teacher): Parenthesis string: (( )[ ])) No! Problem: Check whether “[([])” is valid What you need to show in the terminal(the back part is outputted by you and the blue part is inputted by the user, i.e., teacher): Parenthesis string: [([]) No!
The requirements of reports:
1.The
2.The source code with necessary comments
3.Test case and results (show the screenshot of your terminal)；
4.Summary
3、Valid Parentheses (Stack)[Solution introduction: the second video in 3.6]
[Problem description]
Determine whether the parenthesis string is valid. Assume there are two types
of parentheses in an expression, i.e., “()”, “[]”. The valid parenthesis string must
meet two requirements: 1. Each right parenthesis must match with a left
parenthesis. That is to say, ‘(’ must find ‘)’ and ‘[’ must find ‘]’. 2.A left parenthesis
appearing first should be match later. A left parenthesis appearing later should
be match first. Therefore “([ )]” is not valid and “([ ])” is valid.
The maximal length of the parenthesis sequence is 30.
[Basic requirements]
1) Use stacks to complete this topic.
[Example]
- Problem: Check whether “[([ ][ ])]” is valid
What you need to show in the terminal(the back part is outputted by you
and the blue part is inputted by the user, i.e., teacher):
Parenthesis string: [([ ][ ])]
Yes!
- Problem: Check whether “(( )[ ]))” is validWhat you need to show in the terminal(the back part is outputted by you
and the blue part is inputted by the user, i.e., teacher):
Parenthesis string: (( )[ ]))
No!
- Problem: Check whether “[([])” is valid
What you need to show in the terminal(the back part is outputted by you
and the blue part is inputted by the user, i.e., teacher):
Parenthesis string: [([])
No!
Step by step
Solved in 4 steps with 3 images
