Commitda4cae3

committed

Add C++ implementation

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent04c30ef commitda4cae3Copy full SHA for da4cae3

File tree

+47

-3

lines changed

+47

-3

lines changed

Lines changed: 5 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,7 @@`
`1`	`1`	`#include<stdio.h>`
`2`	`2`	`#include<stdlib.h>`
`3`	`3`
	`4`	`+`
`4`	`5`	`structTreeNode {`
`5`	`6`	`intval;`
`6`	`7`	`structTreeNode*left;`
`@@ -9,12 +10,13 @@ struct TreeNode {`
`9`	`10`
`10`	`11`	`staticintdfs(structTreeNode*node,intsum)`
`11`	`12`	`{`
`12`		`-inttotal=0;`
	`13`	`+/* Here we have to use pre-order */`
	`14`	`+/* sum must be in argument stack of recusion.*/`
`13`	`15`	`sum=sum*10+node->val;`
`14`		`-`
`15`	`16`	`if (node->left==NULL&&node->right==NULL) {`
`16`	`17`	`returnsum;`
`17`	`18`	`}else {`
	`19`	`+inttotal=0;`
`18`	`20`	`if (node->left!=NULL) {`
`19`	`21`	`total+=dfs(node->left,sum);`
`20`	`22`	`}`
`@@ -25,7 +27,7 @@ static int dfs(struct TreeNode* node, int sum)`
`25`	`27`	`}`
`26`	`28`	`}`
`27`	`29`
`28`		`-staticintsumNumbers(structTreeNode*root)`
	`30`	`+intsumNumbers(structTreeNode*root)`
`29`	`31`	`{`
`30`	`32`	`if (root==NULL) {`
`31`	`33`	`return0;`

Lines changed: 42 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,42 @@`
	`1`	`+#include<bits/stdc++.h>`
	`2`	`+`
	`3`	`+usingnamespacestd;`
	`4`	`+`
	`5`	`+/**`
	`6`	`+ * Definition for a binary tree node.`
	`7`	`+ * struct TreeNode {`
	`8`	`+ * int val;`
	`9`	`+ * TreeNode *left;`
	`10`	`+ * TreeNode *right;`
	`11`	`+ * TreeNode() : val(0), left(nullptr), right(nullptr) {}`
	`12`	`+ * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}`
	`13`	`+ * TreeNode(int x, TreeNode left, TreeNode right) : val(x), left(left), right(right) {}`
	`14`	`+ * };`
	`15`	`+*/`
	`16`	`+classSolution {`
	`17`	`+public:`
	`18`	`+intsumNumbers(TreeNode* root) {`
	`19`	`+if (root ==nullptr) {`
	`20`	`+return0;`
	`21`	`+ }`
	`22`	`+returndfs(root,0);`
	`23`	`+ }`
	`24`	`+private:`
	`25`	`+intdfs(TreeNode *root,int sum) {`
	`26`	`+// Here we have to use pre-order.`
	`27`	`+// sum must be in argument stack of recusion.`
	`28`	`+ sum = sum *10 + root->val;`
	`29`	`+if (root->left ==nullptr && root->right ==nullptr) {`
	`30`	`+return sum;`
	`31`	`+ }else {`
	`32`	`+int total =0;`
	`33`	`+if (root->left !=nullptr) {`
	`34`	`+ total +=dfs(root->left, sum);`
	`35`	`+ }`
	`36`	`+if (root->right !=nullptr) {`
	`37`	`+ total +=dfs(root->right, sum);`
	`38`	`+ }`
	`39`	`+return total;`
	`40`	`+ }`
	`41`	`+ }`
	`42`	`+};`

Comments

(0)