三种解法:(1)递归(超时) int minroad(vector<vector<int> >& triangle, int i, int j) { if(i==(triangle.size()-1)) return triangle[i][j]; else return triangle[i][j] + min(minroad(triangle,i+1,j), minroad(triangle,i+1,j+1)); } int minTrace(vector&...