|
|
|
|
|
/*/*******************************************************************************
|
|
|
|
|
|
** **
|
|
|
|
|
|
** Jiedi(China nanjing)Ltd. **
|
|
|
|
|
|
** 创建：丁宋涛 夏曹俊，此代码可用作为学习参考 **
|
|
|
|
|
|
*******************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************FILE INFOMATION***********************************
|
|
|
|
|
|
**
|
|
|
|
|
|
** Project : 算法设计与编程实践---基于leetcode的企业真题库
|
|
|
|
|
|
** Contact : xiacaojun@qq.com
|
|
|
|
|
|
** 博客 : http://blog.csdn.net/jiedichina
|
|
|
|
|
|
** 视频课程 : 网易云课堂 http://study.163.com/u/xiacaojun
|
|
|
|
|
|
腾讯课堂 https://jiedi.ke.qq.com/
|
|
|
|
|
|
csdn学院 https://edu.csdn.net/course/detail/25037
|
|
|
|
|
|
** 51cto学院 http://edu.51cto.com/lecturer/index/user_id-100013755.html
|
|
|
|
|
|
** 老夏课堂 http://www.laoxiaketang.com
|
|
|
|
|
|
**
|
|
|
|
|
|
** 算法设计与编程实践---基于leetcode的企业真题库 课程群 ：296249312 加入群下载代码和交流
|
|
|
|
|
|
** 微信公众号 : jiedi2007
|
|
|
|
|
|
** 头条号 : 夏曹俊
|
|
|
|
|
|
**
|
|
|
|
|
|
*****************************************************************************
|
|
|
|
|
|
//！！！！！！！！！ 算法设计与编程实践---基于leetcode的企业真题库 课程 QQ群：296249312 下载代码和交流*/
|
|
|
|
|
|
/*
|
|
|
|
|
|
* @lc app=leetcode.cn id=110 lang=cpp
|
|
|
|
|
|
*
|
|
|
|
|
|
* [110] 平衡二叉树
|
|
|
|
|
|
* 两层递归：
|
|
|
|
|
|
* height：求高度
|
|
|
|
|
|
* isbalanced：确保它是平衡二叉树
|
|
|
|
|
|
*/
|
|
|
|
|
|
/**
|
|
|
|
|
|
* Definition for a binary tree node.
|
|
|
|
|
|
* struct TreeNode {
|
|
|
|
|
|
* int val;
|
|
|
|
|
|
* TreeNode *left;
|
|
|
|
|
|
* TreeNode *right;
|
|
|
|
|
|
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
|
|
|
|
|
|
* };
|
|
|
|
|
|
*/
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
class Solution {
|
|
|
|
|
|
public:
|
|
|
|
|
|
int height(TreeNode* root){
|
|
|
|
|
|
if(root == NULL)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
int left = height(root->left);
|
|
|
|
|
|
int right = height(root->right);
|
|
|
|
|
|
return max(left+1,right+1);
|
|
|
|
|
|
}
|
|
|
|
|
|
bool isBalanced(TreeNode* root) {
|
|
|
|
|
|
if(root == NULL)
|
|
|
|
|
|
return true;
|
|
|
|
|
|
if(abs(height(root->left)-height(root->right))>1)
|
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
|
|
return (isBalanced(root->left)&& isBalanced(root->right));
|
|
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
|
