algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

纠错

Browse Source 
删除多余的一个 “这” 字
This commit is contained in:
konng
2021-09-18 13:30:25 +08:00
committed by GitHub
parent ff15746108
commit 99e26666ee
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0101.对称二叉树.md
View File

@ -185,7 +185,8 @@ public:
queue<TreeNode*> que; queue<TreeNode*> que;
que.push(root->left); // 将左子树头结点加入队列 que.push(root->left); // 将左子树头结点加入队列
que.push(root->right); // 将右子树头结点加入队列 que.push(root->right); // 将右子树头结点加入队列
while (!que.empty()) { // 接下来就要判断这这两个树是否相互翻转
while (!que.empty()) { // 接下来就要判断这两个树是否相互翻转
TreeNode* leftNode = que.front(); que.pop(); TreeNode* leftNode = que.front(); que.pop();
TreeNode* rightNode = que.front(); que.pop(); TreeNode* rightNode = que.front(); que.pop();
if (!leftNode && !rightNode) { // 左节点为空、右节点为空，此时说明是对称的 if (!leftNode && !rightNode) { // 左节点为空、右节点为空，此时说明是对称的