Leetcode#101 Symmetric Tree
2015-02-02 11:04
288 查看
原题地址
递归比较左儿子和右儿子是否对称,左儿子的左儿子跟右儿子的右儿子比,左儿子的右儿子跟右儿子的左儿子比!打完这一串文字突然发现"儿"字怎么这么奇怪!
代码:
递归比较左儿子和右儿子是否对称,左儿子的左儿子跟右儿子的右儿子比,左儿子的右儿子跟右儿子的左儿子比!打完这一串文字突然发现"儿"字怎么这么奇怪!
代码:
bool mirrorp(TreeNode *a, TreeNode *b) { if (a && b) return a->val == b->val && mirrorp(a->left, b->right) && mirrorp(a->right, b->left); else return a == b; } bool isSymmetric(TreeNode *root) { return !root || mirrorp(root->left, root->right); }
相关文章推荐
- 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:python]101. Symmetric Tree
- leetcode 101 Symmetric Tree
- Leetcode#101. Symmetric Tree(对称树)
- leetcode 101 Symmetric Tree
- 101. Symmetric Tree
- leetcode[101]Symmetric Tree
- [LeetCode 101] Symmetric Tree
- 101:Symmetric Tree【树】【DFS】
- #101 Symmetric Tree
- leetcode-101-Symmetric Tree
- leetcode:101 Symmetric Tree-每日编程第二十题