Leetcode打卡第一天301

1. Leetcode打卡第一天（删除无序括号）
   (python3)
   @函数1

def isvaild(s):
            back = 0
            for ch in s:
                if ch == '(':
                    back += 1
                elif ch == ')':
                    if back == 0:
                        return False
                    else:
                        back -= 1
                else:
                    pass
            return back==0

@函数2（BFS函数）

def dfs(s, index, left, right, res):
            if (left == 0) and (right == 0) and isvaild(s):#判断当前S是否有效，有效则退出
                res.append(s)#
                return 
            for i in range(index, len(s)):#遍历
                ch = s[i]
                if ch in ['(', ')']:
                    if (i > 0) and (ch == s[i-1]): continue
                    if (ch == ')') and (right > 0):
                        dfs(s[:i]+s[i+1:], i, left, right-1, res)
                    elif (ch == '(') and (left > 0):
                        dfs(s[:i]+s[i+1:], i, left-1, right, res)
                    else:
                        pass

@完整代码：

class Solution:
    def removeInvalidParentheses(self, s: str) -> List[str]:
        left, right = 0, 0
        for ch in s:
            if ch == '(':
                left += 1
            elif ch == ')':
                if left == 0:
                    right += 1
                else:
                    left -= 1
            else:
                pass
        def is_vaild(s):#详见函数1
        def dfs(s, index, left, right, res):#详见函数2
        res = []
        dfs(s, 0, left, right, res)
        return list(set(res))

@注意事项：
<left:记录左右括号对不平衡时多出来的左括号数量
<right:记录左右括号对不平衡时多出来的右括号数量

if (ch == ')') and (right > 0):
	dfs(s[:i]+s[i+1:], i, left, right-1, res)
elif (ch == '(') and (left > 0):
	dfs(s[:i]+s[i+1:], i, left-1, right, res)

：此处为剔除多出来的左或者右括号，再重新进入到dfs函数中。