algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 01:15:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #149 from brenobaptista/refactored-101

Browse Source 
Refactored solution 101
This commit is contained in:
halfrost
2021-06-21 08:04:39 +08:00
committed by YDZ
parent 75b8f85315 804bf60609
commit 578c85e416
20 changed files with 287 additions and 286 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go
View File

@ -18,20 +18,20 @@ type TreeNode = structures.TreeNode
// 解法一 dfs
func isSymmetric(root *TreeNode) bool {
return root == nil || dfs(root.Left, root.Right)
}
func dfs(rootLeft, rootRight *TreeNode) bool {
if rootLeft == nil && rootRight == nil {
if root == nil {
return true
}
if rootLeft == nil || rootRight == nil {
return isMirror(root.Left, root.Right)
}
func isMirror(left *TreeNode, right *TreeNode) bool {
if left == nil && right == nil {
return true
}
if left == nil || right == nil {
return false
}
if rootLeft.Val != rootRight.Val {
return false
}
return dfs(rootLeft.Left, rootRight.Right) && dfs(rootLeft.Right, rootRight.Left)
return (left.Val == right.Val) && isMirror(left.Left, right.Right) && isMirror(left.Right, right.Left)
}
// 解法二