Submission #1305439

---

Source Code Expand

import java.util.*;

public class Main {
	Scanner sc = new Scanner(System.in);
	String rep;
	int index;
	void makeTree(Node node) {
//		System.out.println("IND=" + index);
		// 左を調べる
		index++;
		if(rep.charAt(index) == '(') { // 子供がいるか？
			node.left = new Node();
			makeTree(node.left);
		}
		// 中を調べる
		index++;
		index++;
		node.val = 0;
		while(Character.isDigit(rep.charAt(index))) {
			node.val *= 10;
			node.val += (rep.charAt(index) - '0');
			index++;
		}
		//System.out.println(node.val);
		// 右を調べる
		index++;
		index++;
//		System.out.println("RIGHT=" + index);
		if(rep.charAt(index) == '(') { // 子供がいるか？
			node.right = new Node();
			makeTree(node.right);
		}
		index++;
	}
	void doIt() {
		Node [] input = new Node[2];
		for(int i = 0; i < 2; i++) {
			index = 0;
			rep = sc.next();
			input[i] = new Node();
			makeTree(input[i]);
		}
		sumPrint(input[0], input[1]);
		System.out.println();
	}
	void sumPrint(Node n1, Node n2) {
		System.out.print("(");
		if(n1.left != null && n2.left != null) {
			sumPrint(n1.left, n2.left);
		} 
		System.out.print(")");

		System.out.print("[" + (n1.val + n2.val) + "]");
		//System.out.print("[" + n1.val + "," + n2.val + "]");

		System.out.print("(");
		if(n1.right != null && n2.right != null) {
			sumPrint(n1.right, n2.right);
		}
		System.out.print(")");
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		new Main().doIt();
	}

	class Node {
		int val;
		Node left, right;
	}
}

Submission Info

Judge Result