Skip to content

Commit

Permalink
Merge pull request MisterBooo#107 from ztianming/patch-2
Browse files Browse the repository at this point in the history
Update LeetCode第20号问题:有效的括号.md
  • Loading branch information
MisterBooo authored Jul 31, 2020
2 parents 175bbe4 + 50eaab9 commit 20bb4de
Showing 1 changed file with 49 additions and 3 deletions.
52 changes: 49 additions & 3 deletions notes/LeetCode第20号问题:有效的括号.md
Original file line number Diff line number Diff line change
Expand Up @@ -71,7 +71,8 @@

### 代码实现

```
#### C++
```c++
class Solution {
public:
bool isValid(string s) {
Expand Down Expand Up @@ -109,7 +110,52 @@ public:
}
};
```
#### Java
```java
class Solution {
public boolean isValid(String s) {
//String open="({[";
//String close="]})";

Stack<Character> stack = new Stack<Character>();

if(s.length() % 2 != 0)
return false;


for (char c : s.toCharArray())
{
if (c == '(') stack.push(')');
else if (c == '{') stack.push('}');
else if (c == '[') stack.push(']');
else if (stack.isEmpty() || stack.pop() != c) return false;
}

return stack.isEmpty();
}

}
```
#### Python
```python
class Solution(object):
def isValid(self, s):
open_list = ["[", "{", "("]
close_list = ["]", "}", ")"]
stack = []

for i in s:
if i in open_list:
stack.append(i)
elif i in close_list:
pos=close_list.index(i)
if len(stack)>0 and (open_list[pos] == stack[len(stack)-1]):
stack.pop()
else:
return False
if len(stack) == 0:
return True
```



![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/gkcza.png)
![](https://blog-1257126549.cos.ap-guangzhou.myqcloud.com/blog/gkcza.png)

0 comments on commit 20bb4de

Please sign in to comment.