We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
解题思想:
代码:
var isSymmetric = function(root) { if (!root) return true; const isMirror = (l, r) => { if (!l && !r) return true; if (l && r && (l.val === r.val) && isMirror(l.left, r.right) && isMirror(l.right, r.left) ) { return true; } return false; } return isMirror(root.left, root.right); };
复杂度分析:
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Uh oh!
There was an error while loading. Please reload this page.
方法一:递归(分而治之)
解题思想:
代码:
复杂度分析:
方法二:迭代
The text was updated successfully, but these errors were encountered: