1.Description
Given a string s containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
2.Example
Input: s = "()[]{}"
Output: true
3.Solution
Stack的几个常用方法
操作 操作
empty() 测试堆栈是否为空。
peek() 查看堆栈顶部的对象,但不从堆栈中移除它。
pop() 移除堆栈顶部的对象,并作为此函数的值返回该对象。
push(E item) 把项压入堆栈顶部。
search(Object o) 返回对象在堆栈中的位置,以 1 为基数。
1.我的解
class Solution {
public boolean isValid(String s) {
Stack<Character> stack= new Stack<Character>();
char[] chs = s.toCharArray();
int len = chs.length;
for(int i=0;i<len-1;i++) {
if(chs[i] == '(' || chs[i] == '{' || chs[i] == '[') {
stack.push(chs[i]);
}else if(chs[i] == ')' || chs[i] == '}' || chs[i] == ']') {
if(stack.peek()==chs[i]) {
stack.pop();
}
}
}
return stack.isEmpty();
}
}
2.leetcode题解
class Solution {
// Hash table that takes care of the mappings.
private HashMap<Character, Character> mappings;
// Initialize hash map with mappings. This simply makes the code easier to read.
public Solution() {
this.mappings = new HashMap<Character, Character>();
this.mappings.put(')', '(');
this.mappings.put('}', '{');
this.mappings.put(']', '[');
}
public boolean isValid(String s) {
// Initialize a stack to be used in the algorithm.
Stack<Character> stack = new Stack<Character>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
// If the current character is a closing bracket.
if (this.mappings.containsKey(c)) {
// Get the top element of the stack. If the stack is empty, set a dummy value of '#'
char topElement = stack.empty() ? '#' : stack.pop();
// If the mapping for this bracket doesn't match the stack's top element, return false.
if (topElement != this.mappings.get(c)) {
return false;
}
} else {
// If it was an opening bracket, push to the stack.
stack.push(c);
}
}
// If the stack still contains elements, then it is an invalid expression.
return stack.isEmpty();
}
}
3.
class Solution {
public boolean isValid(String s) {
Stack<Character> st = new Stack<Character>();
for(char c : s.toCharArray()){
if(c == '(') st.push(')');
else if(c == '[') st.push(']');
else if(c == '{') st.push('}');
else if(st.isEmpty() || st.pop() != c)
return false;
}
return st.isEmpty();
}
}