题目:给一个二叉树,然后计算树的最大路径;二叉树举例:1(2,3(4,5)) : 1是根,2和3是叶子,然后3又有4,5叶子。
package test;
import java.util.*;
public class Tree {
static class TreeNode{
int val;
TreeNode left;
TreeNode right;
public TreeNode(int val){
this.val=val;
}
public TreeNode(int val, TreeNode left, TreeNode right){
this.val=val;
this.left=left;
this.right=right;
}
}
public static void main(String[] args) {
String str="1(2,3(4,5))";
//lineNumsList的结果为1,2,3,4,5
//str.split(",|\\(|\\)"),str以, or ( or )进行分割
List<String> lineNumsList = Arrays.asList