leetcode之Symmetric Tree
来源:互联网 发布:范磊c语言 编辑:程序博客网 时间:2024/06/14 18:22
判断是不是对称树,用到递归思想就很方便。但是要注意递归结束的条件!
(1)C语言实现
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool isMirror(struct TreeNode* p,struct TreeNode* q){
if(p==NULL || q==NULL)
return p==q;
if(p->val!=q->val)
return false;
return isMirror(p->left,q->right)&&isMirror(p->right,q->left);
}
bool isSymmetric(struct TreeNode* root) {
if(root == NULL)
return true;
return isMirror(root->left,root->right);
}
(2)C++实现
/**
* 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:
bool isSymmetric(TreeNode* root) {
if(root == NULL)
return true;
return isMirror(root->left,root->right);
}
bool isMirror(TreeNode* p, TreeNode* q){
if(p==NULL|| q==NULL)
return p==q;
if(p->val!=q->val)
return false;
return isMirror(p->left, q->right)&&isMirror(p->right, q->left);
}
};
(3)java实现
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isSymmetric(TreeNode root) {
if(root == null)
return true;
return isMirror(root.left,root.right);
}
public boolean isMirror(TreeNode p, TreeNode q){
if(p==null || q== null)
return p==q;
if(p.val!=q.val)
return false;
return isMirror(p.left,q.right)&&isMirror(p.right,q.left);
}
}
- LeetCode 之 Symmetric Tree
- LeetCode之Symmetric Tree
- LeetCode之Symmetric Tree
- LeetCode之Symmetric Tree
- LeetCode 之 Symmetric Tree
- leetcode之Symmetric Tree
- leetcode之 Symmetric Tree
- leetcode之Symmetric Tree
- 【Leetcode】之Symmetric Tree
- LeetCode之 Symmetric Tree
- leetcode 之 Symmetric Tree 镜像树
- Leetcode - Tree - Symmetric Tree
- Leetcode - Tree - Symmetric Tree
- LeetCode[Tree]: Symmetric Tree
- [leetcode][tree] Symmetric Tree
- LeetCode: Symmetric Tree
- [Leetcode] Symmetric Tree
- LeetCode : Symmetric Tree
- error:[WinError 2] 系统找不到指定文件
- Linux查看内存等硬件信息
- Cadence 安装问题/eda/cadence/tools/dfII/bin/icfb: symbol lookup error: /usr/lib/libXext.so.6: undefined
- 【LeetCode】56. Merge Intervals
- 深入理解java虚拟机(一):java内存区域(内存结构划分)
- leetcode之Symmetric Tree
- 请教别人的时候一定要虚心
- Linux文件操作命令
- hdu 4010
- c++作业3-多分段函数求值
- 【Java集合源码剖析】HashMap源码剖析
- jQuery选择器
- Python操作gpio
- 三和 韓長庚 先生의 寫眞