如何处理java中对{}，[]，() 的解析，不仅可以用正则，也可以用堆栈的方式，算法的想法做

public static String[] getSplitString(String param) {

            String[] rawParams = param.split(",");
            int len = rawParams.length;
            ArrayStack stack = new ArrayStack(param.length());
            Map<String, String> map = new HashMap<>();
            map.put("{", "}");
            map.put("[", "]");
            map.put("(", ")");
            String[] gParams = new String[len];
            int index = 0;
            StringBuffer buffer = new StringBuffer();
            for (int i = 0; i < len; i++) {
                char[] c = rawParams[i].toCharArray();
                int l = c.length;
                for (int j = 0; j < l; j++) {
                    if (c[j] == 91 || c[j] == 123 || c[j] == 40) {
                        stack.push(c[j]);
                    }
                    if (c[j] == 93 || c[j] == 125 || c[j] == 41) {
                        String temp = String.valueOf(stack.pop());
                        if (c[j] != map.get(temp).toCharArray()[0]) {
                            return null;
                        }
                    }

                }

                if (stack.size() > 0) {
                    buffer.append(rawParams[i]);
                    buffer.append(",");
                } else {
                    gParams[index] = buffer.append(rawParams[i]).toString();
                    index++;
                    buffer = new StringBuffer();
                }

            }

            int glen = gParams.length;
            for (int k = 0; k < glen ; k++) {
                if (null == gParams[k]) {
                    continue;
                }
                char[] chars = gParams[k].toCharArray();
                int l = chars.length;
                if (chars[0] == 34 || chars[0] == 39) {
                    gParams[k] = String.valueOf(chars, 1, l - 2);
                }
            }
            return gParams;
        }