LeetCode – Valid Parentheses (Java) public static boolean isValid(String s) { char[] charArray = s.toCharArray...

Please Visit: http://ift.tt/1ajReyV

LeetCode – Valid Parentheses (Java)

public static boolean isValid(String s) {

char[] charArray = s.toCharArray();



HashMap<Character, Character> map = new HashMap<Character, Character>();

map.put('(', ')');

map.put('[', ']');

map.put('{', '}');



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



for (Character c : charArray) {

if (map.keySet().contains(c)) {

stack.push(c);

} else if (map.values().contains(c)) {

if (!stack.isEmpty() && map.get(stack.peek()) == c) {

stack.pop();

} else {

return false;

}

}

}

return stack.isEmpty();

}

http://ift.tt/1qjYAQ2

http://ift.tt/1qjYB6g

LeetCode – Valid Parentheses (Java)

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1wRL7iI

via LifeLong Community