How to use Python to solve the problem of parenthesis matching

This article mainly introduces "how to use Python to solve the problem of parenthesis matching". In daily operation, I believe many people have doubts about how to use Python to solve the problem of parenthesis matching. The editor consulted all kinds of materials and sorted out simple and easy-to-use operation methods. I hope it will be helpful for you to answer the doubt of "how to solve the problem of parenthesis matching with Python". Next, please follow the editor to study!

The overall implementation idea: with the help of the List of Python, because the Append method of the list is equivalent to the Push method of the stack, that is, the push-in of the stack, and the Pop method of the list is equivalent to the popup of the Pop method of the stack.

Detailed ideas:

First, set up a dictionary to store the types of symbols we want to traverse.

Second, set up the two lists to store the opening and closing parentheses of various parentheses, and then traverse the given string in the following cases:

Output True directly when the string is empty

Output False when the symbols of a string do not match in pairs

When the symbol in the string is not a symbol type in the dictionary, ignore it directly

Traversing the string, pressing the positive symbol into the stack, and popping up the stack if the traversal character is a positive symbol (when it happens to be the nearest symbol).

The code is implemented as follows:

# define the symbol type to check for matching brackets = {'}':'{',']':'[',')':'(','>':'