# Imports from Stack_array import Stack # Constants BAL= 'is balanced' NO_MATCH = 'mismatched brackets' M_RIGHT = 'too many right brackets' M_LEFT = 'too many left brackets' def balanced (string): |||||| Determines if a string contains has balanced brackets or not. Non-bracket characters are ignored. Uses a Stack. Brackets include {}, [], (), <>>. Use: is_balanced = balanced (string) Parameters: 1 string the string to test (str) Returns: |||||| is_balanced (string) - BALANCED if the brackets in string are is_balanced NO_MATCH if the brackets in string are mismatched MORE_RIGHT if there are more right brackets than left in string MORE_LEFT if there are more left brackets than right in string
![# Imports
from Stack_array import Stack
# Constants
BAL = 'is balanced'
NO_MATCH = 'mismatched brackets'
M_RIGHT = 'too many right brackets'
M_LEFT = 'too many left brackets'
def balanced (string):
|| || ||
Determines if a string contains has balanced brackets or not. Non-bracket
characters are ignored. Uses a Stack. Brackets include {}, [], 0), «>.
Use: is_balanced = balanced (string)
Parameters:
string the string to test (str)
Returns:
|| || ||
is_balanced (string)
BALANCED if the brackets in string are is_balanced
NO_MATCH if the brackets in string are mismatched
MORE_RIGHT if there are more right brackets than left in string
MORE_LEFT if there are more left brackets than right in string
#your code here
return](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ffa21f7d2-4dd0-4238-8547-d147ae559015%2F46eb9ef5-3ae2-40a4-aecc-a0c99d8e9d76%2F85yynen_processed.png&w=3840&q=75)
Checking if a given string has balanced brackets is the task at hand. In computer science and software development, processes like parsing, grammar checking, and analysing mathematical equations frequently include this issue. "Balanced brackets" in this sense refers to the fact that there is a matching closing bracket (such as ')', '}', ']') for each open bracket (such as '(', '{', '['). Developing a method to ascertain whether or not the input string's brackets are balanced is the difficult part.
Upon receiving a string as input, the function utilises a stack data structure to monitor any open brackets it encounters while navigating the string. The function determines if a closed bracket matches the most recent open bracket on the stack when it comes across one. The brackets are misaligned if it doesn't; If it does, the brackets are balanced. The tool also detects instances in which an imbalance would arise from using an excessive number of left or right brackets.
Step by step
Solved in 5 steps with 2 images
