Given a string containing just the characters '('
, ')'
, '{'
, '}'
, '['
and ']'
, determine if the input string is valid.
An input string is valid if:
Note that an empty string is also considered valid.
Example 1:
Input: "()" Output: true
Example 2:
Input: "()[]{}" Output: true
Example 3:
Input: "(]" Output: false
Example 4:
Input: "([)]" Output: false
Example 5:
Input: "{[]}" Output: true Solution 1:
class Solution {
public boolean isValid(String s) {
if(s.length()<=1) return false;
Stack<Character> paraS = new Stack<Character>();
for(int i=0;i<s.length();i++){
if(s.charAt(i)=='('||s.charAt(i)=='{'||s.charAt(i)=='['){
paraS.push(s.charAt(i));
}else if(s.charAt(i)==')'){
if(paraS.size()==0 || paraS.pop()!= '(') return false;
}else if(s.charAt(i)==']'){
if(paraS.size()==0 || paraS.pop()!= '[') return false;
}else if(s.charAt(i)=='}'){
if(paraS.size()==0 || paraS.pop()!= '{') return false;
}
}
return paraS.isEmpty();
}
}
Question : Given an array of integers A, return the largest integer that only occurs once.…
Jump search algorithm is a pretty new algorithm to search for an element in a…
What is Knuth Morris Pratt or KMP algorithm ? KMP is an algorithm which is…
Binary Search is a Logarithmic search which finds the target element in a sorted array…
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X…
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such…
This website uses cookies.