堆

Whalefall126

Write a Python program to check if parentheses are balanced using a stack. Use the method q5_parentheses, which returns True if balanced. Otherwise, False. A set of parentheses is balanced if for every opening parenthesis there is a closing and matching parenthesis. Hence:

    ({[]})()
is balanced, while:

    ({[}])
is not.

def q5_parentheses(rstring):
   


​
assert not q5_parentheses ("{")
assert q5_parentheses ("{[()]}")
assert not q5_parentheses ("{[(])}")

求解，chat和bard都不对

陶远航

Here's the corrected code for the q5_parentheses function that uses a stack to check if parentheses are balanced:

1. def q5_parentheses(rstring):
   
2.     stack = []
   
3.     opening = set(["(", "[", "{"])
   
4.     closing = set([")", "]", "}"])
   
5. 
   
6.     for char in rstring:
   
7.         if char in opening:
   
8.             stack.append(char)
   
9.         elif char in closing:
   
10.             if not stack:
    
11.                 return False
    
12.             top = stack.pop()
    
13.             if (top == "(" and char != ")") or (top == "[" and char != "]") or (top == "{" and char != "}"):
    
14.                 return False
    
15. 
    
16.     return len(stack) == 0
    

复制代码

Now, let's test the function with the provided test cases:

1. assert not q5_parentheses("{")
   
2. assert q5_parentheses("{[()]}")
   
3. assert not q5_parentheses("{[(])}")
   

复制代码

The function should pass these assertions without raising any exceptions.
请注意，本回答来自GPT-4
如果问题已经解决，请设置最佳答案