Submission #1408311

---

Source Code Expand

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Main {
    void run() {
        Scanner scan = new Scanner(System.in);
        StringBuilder tree1 = new StringBuilder();
        StringBuilder tree2 = new StringBuilder();
        tree1.append(scan.next());
        tree2.append(scan.next());
        String tree = "";
        int index = 0;
        while (true) {
            if (index >= tree1.length() || index >= tree2.length())
                break;
            char c1 = tree1.charAt(index);
            char c2 = tree2.charAt(index);
            if (c1 == c2 || Character.isDigit(c1)) {
//                System.out.println("digit:" + Character.isDigit(c1) + " " + c1);
                if (Character.isDigit(c1)) {
                    String num1 = "";
                    String num2 = "";
                    num1 += c1;
                    num2 += c2;
                    while (Character.isDigit(tree1.charAt(index + 1))) {
                        num1 += tree1.charAt(index + 1);
                        tree1.deleteCharAt(index + 1);
                    }
                    while (Character.isDigit(tree2.charAt(index + 1))) {
                        num2 += tree2.charAt(index + 1);
                        tree2.deleteCharAt(index + 1);
                    }
                    int sum = Integer.parseInt(num1) + Integer.parseInt(num2);
                    tree += String.valueOf(sum);
                } else {
                    tree += c1;
                }
                index++;
            }
            else {
                int count = 0;
                if (c1 == '(') {
                    int c = 0;
                    while (count != 2) {
                        if (tree1.charAt(index) == '(')
                            c++;
                        else if (tree1.charAt(index) == ')') {
                            c--;
                            if (c == 0)
                                count++;
                        }
                        tree1.deleteCharAt(index);
                    }
                } else {
                    int c = 0;
                    while (count != 2) {
                        if (tree2.charAt(index) == '(')
                            c++;
                        else if (tree2.charAt(index) == ')') {
                            c--;
                            if (c == 0)
                                count++;
                        }
                        tree2.deleteCharAt(index);
                    }
                }
            }
//            System.out.println(tree1);
//            System.out.println(tree2);
//            System.out.println(tree);
        }
        System.out.println(tree);
    }

    public static void main(String[] args) {
        new Main().run();
    }
}

Submission Info

Judge Result