技巧:链表的掌握,以及auto 对于c++11的使用技巧
代码:
/**
* 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:
pair<int,bool> DFS(TreeNode *root){
if(root==NULL) return {0,true};
auto l = DFS(root->left);
auto r = DFS(root->right);
return {max(l.first,r.first)+1,l.second && r.second && abs(l.first-r.first)<=1};
}
bool isBalanced(TreeNode* root) {
return DFS(root).second;
}
};