Given a binary tree, return the tilt of the whole tree.
The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtree node values. Null node has tilt 0.
The tilt of the whole tree is defined as the sum of all nodes' tilt.
Example:
Input: 1 / \ 2 3 Output: 1 Explanation: Tilt of node 2 : 0 Tilt of node 3 : 0 Tilt of node 1 : |2-3| = 1 Tilt of binary tree : 0 + 0 + 1 = 1
Note:
- The sum of node values in any subtree won't exceed the range of 32-bit integer.
- All the tilt values won't exceed the range of 32-bit integer.
自己的解法
我自己用了递归来解决,占用内存很多。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int findTilt(TreeNode* root) {
int result=0;
find(root,&result);
return result;
}
int find(TreeNode* root,int *result){
if(root==NULL){
return 0;
}
else
{
int left=find(root->left,result);
int right=find(root->right,result);
*result+=abs(left-right);
return root->val+left+right;
}
}
};
看了下高票c++解法,类似~只是我的是把result的地址传到递归里去了,实际没必要,在外面声明就好了~试了下如下方式比我的速度快~内存差不多
int res=0;
int findTilt(TreeNode* root) {
DFS(root);
return res;
}
int DFS(TreeNode* n) {
if(n==NULL) return 0;
int l=DFS(n->left);
int r=DFS(n->right);
res+=abs(l-r);
return l+r+n->val;
}