leetcode 101. Symmetric Tree
来源:互联网 发布:网络电子赌博的危害 编辑:程序博客网 时间:2024/06/07 11:17
这道题目,如果不是和100题一起做,还难以发现它们的相似性。检查左右两棵树是否对称,三种基本判断返回条件。与100不同就是递归参数不同。
public class Solution { public boolean isSymmetric(TreeNode root) { if(root == null) return true; return isSymmetric(root.left,root.right); } public boolean isSymmetric(TreeNode left, TreeNode right) { if(left == null && right == null) return true; if(left == null || right == null) return false; if(left.val != right.val) return false; else { return isSymmetric(left.left,right.right) && isSymmetric(left.right,right.left); } }}
0 0
- LeetCode 101. Symmetric Tree
- [LeetCode]101.Symmetric Tree
- 【LeetCode】101.Symmetric Tree
- [Leetcode] 101. Symmetric Tree
- LeetCode --- 101. Symmetric Tree
- [leetcode] 101.Symmetric Tree
- LeetCode : 101. Symmetric Tree
- [leetcode]101.Symmetric Tree
- Leetcode 101. Symmetric Tree
- 101. Symmetric Tree LeetCode
- [LeetCode]101. Symmetric Tree
- [LeetCode]101. Symmetric Tree
- [LeetCode]101. Symmetric Tree
- leetcode 101. Symmetric Tree
- LeetCode#101. Symmetric Tree
- Leetcode 101. Symmetric Tree
- Leetcode 101. Symmetric Tree
- LeetCode *** 101. Symmetric Tree
- ajax 局部页面更新
- leetcode 100 same tree
- Highgui_1_用户界面
- Kubernetes 1.3 从入门到进阶 安装篇(1)
- js变量
- leetcode 101. Symmetric Tree
- Bellman-Ford算法实现
- 机器学习算法基础概念学习总结
- 使用django-grappelli美化diango后台
- django STATIC_URL STATIC_ROOT MEDIA_URL MEDIA_ROOT
- 21File练习
- 【t040】SETI任务
- 分数拆分
- POJ2538 ZOJ1884 UVA10082 WERTYU