今天面试问了一道题。说一串字符串由这几个符号组成"<>{}[]()”,写一个算法，例如如果组成方式为“<>{[]}{}()”这种，也就是XML格式那种则返回true。否则返回false；

            package
             hao;


            import
             java.util.HashMap;

            import
             java.util.Map;


            public
            class
             duichenpanduan {

    
            public
            static String a = "<>{><}(<<>><>)";
    publicstatic Map<String, String> map = new HashMap<>();

    publicstaticvoid main(String[] args) {
        map.put("<", ">");
        map.put("{", "}");
        map.put("[", "]");
        map.put("(", ")");
        System.out.println(test(a, a));
    }

    publicstaticboolean test(String a1, String a2) {
        for (int i = 0; i < a1.length() - 1; i++) {
            String c = a1.charAt(i + 1) + "";
            String b = map.get(a1.charAt(i) + "");
            if (c.equals(b)) {
                String a = a1.replaceFirst("\\" + a1.charAt(i) + "\\" + a1.charAt(i + 1), "");
                System.out.println("去对称前=" + a1);
                System.out.println("去对称后=" + a);
                if(a.equals("")){
                    returntrue;
                }elseif ( !a.equals(a1) || a.length() % 2 != 0) {
                    return test(a, a1);
                } 
            }
        }
        returnfalse;
    }
}