1、二叉树的最大路径和;66%#include<bits/stdc++.h> using namespace std; struct node{ int val; vector<node*> childs; node(int val): val(val){}; node(): val(0){}; }; long ret = INT_MIN; long get_max_path(node* n){ if(n == NULL) return 0; if(n->childs.size() == 0) ...