给你一个由若干括号和字母组成的字符串 s ，删除最小数量的无效括号，使得输入的字符串有效。 返回所有可能的结果。答案可以按 任意顺序 返回

1. class Solution(object):

2. def removeInvalidParentheses(self, s):

3. """

4. :type s: str

5. :rtype: List[str]

6. """

7. if len(s) == 0:

8. return [""]

9. count1 = 0

10. count2 = 0

11. for str_num in s:

12. count1 += (str_num=="(")

13. if count1 == 0:

14. count2 += (str_num==")")

15. else:

16. count1 -= (str_num==")")

17. start = 0

18. res = []

19. self.DFS(s, start, count1, count2, res)

20. return res

21. def DFS(self, s, start, count1, count2, res):

22. if count1 == 0 and count2 == 0: #一样多

23. if self.isValid(s):

24. res.append(s)

25. return

26. else:

27. for i in range(start, len(s)):

28. if i != start and s[i] == s[i-1]:

29. continue #重复的只计算一次

30. elif count1 > 0 and s[i] == "(": #左多

31. self.DFS(s[:i]+s[i+1:], i, count1-1, count2, res)

32. elif count2 > 0 and s[i] == ")": #右多

33. self.DFS(s[:i]+s[i+1:], i, count1, count2-1, res)

34. def isValid(self, string):

35. count = 0

36. for i in range(len(string)):

37. if string[i] == "(":

38. count += 1

39. elif string[i] == ")":

40. count -= 1

41. if count < 0:

42. return False

43. return count == 0