-
今日学习的文章链接,或者视频链接
-
自己看到题目的第一想法
-
看完代码随想录之后的想法
层序遍历:
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*> que;
if (root != NULL) que.push(root);
vector<vector<int>> result;
while(!que.empty()){
int size = que.size();
vector<int> cur_level;
while(size--){
TreeNode* node = que.front();
que.pop();
cur_level.push_back(node->val);
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
result.push_back(cur_level);
}
return result;
}
};
226:
注意两种思想的解法:
class Solution {
public:
void traverse(TreeNode* cur) {
if (cur == NULL) return;
auto tmp = cur->left;
cur->left = cur->right;
cur->right = tmp;
traverse(cur->left);
traverse(cur->right);
}
TreeNode* invertTree(TreeNode* root) {
//遍历的思想:
traverse(root);
return root;
/*分解问题的思想
if (root == NULL) return root;
TreeNode* left_reversed = invertTree(root->left);
TreeNode* right_reversed = invertTree(root->right);
root->left = right_reversed;
root->right = left_reversed;
return root;
*/
}
};
101:
对称二叉树:
class Solution {
public:
bool compare(TreeNode* left, TreeNode* right){
if (left == NULL && right != NULL) return false;
else if (left != NULL && right == NULL) return false;
else if (left == NULL && right == NULL) return true;
else if (left->val != right->val) return false; // 注意这里我没有使用else
bool outside = compare(left->left, right->right); // 左子树:左、 右子树:右
bool inside = compare(left->right, right->left); // 左子树:右、 右子树:左
bool isSame = outside && inside; // 左子树:中、 右子树:中(逻辑处理)
return isSame;
}
bool isSymmetric(TreeNode* root) {
if (root == NULL) return true;
return compare(root->left, root->right);
}
};
-
自己实现过程中遇到哪些困难
-
今日收获,记录一下自己的学习时长