1、LeetCode513找树左下角的值
题目链接:513、找树左下角的值
层序遍历法比较简单:
class Solution {
public:
int findBottomLeftValue(TreeNode* root) {
queue<TreeNode*> que;
if (root!=NULL) que.push(root);
int result;
while (!que.empty())
{
int size = que.size();
for (int i = 0; i < size; i++)
{
TreeNode * Node = que.front();
que.pop();
if (i == 0) result = Node->val;
if (Node->left) que.push(Node->left);
if (Node->right) que.push(Node->right);
}
}
return result;
}
};
递归法:
当遇到叶子节点的时候,就需要统计一下最大的深度了。
注意两个return的位置。
代码中的回溯,两种回溯是一样的:
if (Node->left)
{
traversal(Node->left, depth + 1);
}
if (Node->left) {
depth++;
traversal(Node->left, depth);
depth--;
}
class Solution {
public:
int maxDepth = INT_MIN;
int result;
void traversal(TreeNode * Node, int depth)
{
if (Node->left == NULL && Node->right == NULL)
{
if (depth > maxDepth)
{
maxDepth = depth;
result = Node->val;
}
return;
}
if (Node->left)
{
traversal(Node->left, depth + 1);
}
if (Node->right)
{
traversal(Node->right, depth + 1);
}
return;
}
int findBottomLeftValue(TreeNode* root) {
traversal(root, 0);
return result;
}
};
2、LeetCode112路径总和
题目链接:112、路径总和
如何统计这一条路径的和,不要去累加然后判断是否等于目标和,可以用递减,让计数器count初始为目标和,然后每次减去遍历路径节点上的数值。
如果最后count == 0,同时到了叶子节点的话,说明找到了目标和。
如果遍历到了叶子节点,count不为0,就是没找到。
class Solution {
public:
bool traversal(TreeNode* root, int count)
{
if (root ->left == NULL && root->right == NULL && count ==0) return true;
if (root->left == NULL && root->right == NULL) return false;
if (root->left)
{
count -= root->left->val;
if (traversal(root->left, count)) return true;
count += root->left->val;
}
if (root->right)
{
count -= root->right->val;
if (traversal(root->right, count)) return true;;
count += root->right->val;
}
return false;
}
bool hasPathSum(TreeNode* root, int targetSum) {
if (root == NULL) return false;
return traversal(root, targetSum - root->val);
}
};
递归的代码又可写为:
if (root->left)
{
if (traversal(root->left, count - root->left->val)) return true;
}
if (root->right)
{
if (traversal(root->right, count - root->right->val)) return true;;
}
3、LeetCode113 路径总和II
题目链接:113、路径总和II
path.push_back(root->val), 递归,当遍历到叶子结点且count=0时,result.push_back(path),
count回溯,path也要回溯。
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void traversal(TreeNode* root, int count)
{
if (root->left == NULL && root->right == NULL && count == 0)
{
result.push_back(path);
return;
}
if (root->left == NULL && root->right == NULL) return;
if (root->left)
{
path.push_back(root->left->val);
traversal(root->left, count - root->left->val);
path.pop_back();
}
if (root->right)
{
path.push_back(root->right->val);
traversal(root->right, count - root->right->val);
path.pop_back();
}
return;
}
vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
result.clear();
path.clear();
if (root == NULL) return result;
path.push_back(root->val);
traversal(root, targetSum - root->val);
return result;
}
};
4、LeetCode106 从中序与后序遍历构造二叉树
题目链接: 106、从中序与后序遍历构造二叉树
-
第一步:如果数组大小为零的话,说明是空节点了。
-
第二步:如果不为空,那么取后序数组最后一个元素作为节点元素。
-
第三步:找到后序数组最后一个元素在中序数组的位置,作为切割点
-
第四步:切割中序数组,切成中序左数组和中序右数组 (顺序别搞反了,一定是先切中序数组)
-
第五步:切割后序数组,切成后序左数组和后序右数组
-
第六步:递归处理左区间和右区间
class Solution {
private:
TreeNode* traversal(vector<int>& inorder, vector<int>& postorder)
{
if (postorder.size() == 0) return NULL;
//根节点
int rootValue = postorder[postorder.size() - 1];
TreeNode * root = new TreeNode(rootValue);
if (postorder.size() == 1) return root;
//根节点在中序里的下标
int delimiterIndex;
for (delimiterIndex = 0; delimiterIndex < inorder.size(); delimiterIndex++)
{
if (inorder[delimiterIndex] == rootValue)
{
break;
}
}
//分割中序
vector<int> leftinorder(inorder.begin(), inorder.begin() + delimiterIndex);
vector<int> rightinorder(inorder.begin() + delimiterIndex + 1, inorder.end());
postorder.resize(postorder.size() - 1);
//分割后序
vector<int> leftpostorder(postorder.begin(), postorder.begin() + leftinorder.size());
vector<int> rightpostorder(postorder.begin() + leftinorder.size(), postorder.end());
root->left = traversal(leftinorder, leftpostorder);
root->right = traversal(rightinorder, rightpostorder);
return root;
}
public:
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
if (inorder.size() == 0 || postorder.size() == 0) return NULL;
return traversal(inorder, postorder);
}
};
5、LeetCode105 从前序与中序遍历构造二叉树
题目链接:105、从前序与中序遍历构造二叉树
class Solution {
public:
TreeNode* traversal(vector<int>& preorder, vector<int>& inorder)
{
if (preorder.size() == 0) return NULL;
int rootValue = preorder[0];
TreeNode* root = new TreeNode(rootValue);
if (preorder.size() == 1) return root;
//根节点在中序里的位置
int delimiterIndex;
for (delimiterIndex = 0; delimiterIndex < inorder.size(); delimiterIndex++)
{
if (inorder[delimiterIndex] == rootValue)
{
break;
}
}
//先分割中序
vector<int> leftinorder(inorder.begin(), inorder.begin() + delimiterIndex);
vector<int> rightinorder(inorder.begin() + delimiterIndex + 1, inorder.end());
vector<int> leftpreorder(preorder.begin() + 1, preorder.begin() + 1 + leftinorder.size());
vector<int> rightpreorder(preorder.begin() + 1 + leftinorder.size(), preorder.end());
root->left = traversal(leftpreorder, leftinorder);
root->right = traversal(rightpreorder, rightinorder);
return root;
}
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
if (preorder.size() == 0 || inorder.size() == 0) return NULL;
return traversal(preorder, inorder);
}
};