LeetCode : Longest Valid Parentheses [java]

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.

For "(()", the longest valid parentheses substring is "()", which has length = 2.

Another example is ")()())", where the longest valid parentheses substring is "()()", which has length = 4.

思路：使用另一个等长数组标记合法的连续区间，之后扫描最大的连续区。

import java.util.HashMap;
import java.util.Map;
import java.util.Stack;

public class Solution {
    public int longestValidParentheses(String s) {
		Stack<Map<Character,Integer>> stack = new Stack<>();
		boolean[] flag = new boolean[s.length()];
		if (s == null || s.length() == 0) {
			return 0;
		}
		for (int i = 0; i < s.length(); i++) {
			char ch = s.charAt(i);
			if (ch == '(') {
				Map<Character,Integer> t_map = new HashMap<Character, Integer>();
				t_map.put(ch, i);
				stack.push(t_map);
			} else if (ch == ')' && !stack.isEmpty()) {
				flag[i] = true;
				Map<Character,Integer> t_map = stack.pop();
				flag[t_map.get('(')] = true;
			}
		}
		int curLength = 0;
		int maxLength = 0;
		for (int i = 0; i < flag.length; i++) {
			if (flag[i]) {
				curLength++;
			} else {
				curLength = 0;
			}
			maxLength = maxLength > curLength ? maxLength : curLength;
		}
		return maxLength;
    }
    
    
}