void mySum(TreeNode *root,int&mid,int&res){
mid = mid*10+root->val;
if(root->left==NULL&&root->right==NULL){
res += mid;
mid /=10;
return;
}
if(root->left!=NULL) mySum(root->left,mid,res);
if(root->right!=NULL) mySum(root->right,mid,res);
mid /= 10;
}
int sumNumbers(TreeNode *root) {
int res=0;
int mid=0;
if(root==NULL) return res;
mySum(root,mid,res);
return res;
}
matrix1d sum(matrix2d myVector) {
matrix1d mySum(myVector.size(),0.0);
for (int i=0; i<myVector.size(); i++) {
for (int j=0; j<myVector[i].size(); j++) {
mySum[i]+=myVector[i][j];
}
}
return mySum;
}
