代码随想录算法训练营day17

1.最大二叉树

1.1 题目

. - 力扣（LeetCode）

1.2 题解

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
	TreeNode* constructMaximumBinaryTree(vector<int>& nums) 
	{
		TreeNode* node = new TreeNode(0);
		//确定循环终止条件
		if (nums.size() == 1)
		{
			node->val = nums[0];
			return node;
		}

		//确定单层递归逻辑
		//找到最大值以及切割点
		int maxValue=0;
		int qiegePoint;
		for (int i = 0; i < nums.size(); i++)
		{
			if (nums[i] > maxValue)
			{
				maxValue = nums[i];
				qiegePoint = i;
			}
		}
		node->val = maxValue;
		//开始切割
		//切割左数组，得先确保左数组里面有元素，左闭右开
		if (qiegePoint > 0)
		{
			//新建一个数组
			vector<int> leftVec(nums.begin(), nums.begin()+qiegePoint);
			node->left = constructMaximumBinaryTree(leftVec);
		}

		//切割左数组,得先确保右数组里面有值，左闭右开
		if (qiegePoint < nums.size() - 1)
		{
			vector<int> rightVec(nums.begin() + qiegePoint + 1, nums.end());
			node->right = constructMaximumBinaryTree(rightVec);
		}
		return node;
	}
};

2.合并二叉树

2.1 题目

. - 力扣（LeetCode）

2.2 题解

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
	TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) 
	{
		//确定终止条件
		if (root1 == nullptr)return root2;
		if (root2 == nullptr)return root1;

		//确定单层递归逻辑，中左右前序遍历
		//不定义新树了，直接更改树1
		//都不为空则相加
		root1->val += root2->val;

		//左
		root1->left = mergeTrees(root1->left, root2->left);
		//右
		root1->right = mergeTrees(root1->right, root2->right);

		return root1;

	}
};

3.二叉搜索树中的搜索

3.1 题目

. - 力扣（LeetCode）

3.2 题解

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
	TreeNode* searchBST(TreeNode* root, int val) 
	{
		while (root != nullptr)
		{
			if (root->val < val)
			{
				root = root->right;
			}
			else if (root->val > val)
			{
				root = root->left;
			}
			else
			{
				return root;
			}
		}
		return nullptr;
	}
};

4.验证二叉搜索树

4.1 题目

. - 力扣（LeetCode）

4.1 题解

class Solution {
public:
	bool isValidBST(TreeNode* root)
	{
		vector<int> vec;
		traversal(root, vec);
		int tmp;
		for (int i = 0; i < vec.size(); i++)
		{
			if (i > 0)
			{
				if (vec[i] <= vec[i - 1])
				{
					return false;
				}
			}
			
		}
		return true;
	}
	void traversal(TreeNode* root,vector<int>& vec)
	{
		if (root == nullptr)return;

		//确定单层递归逻辑,中序遍历
		
		traversal(root->left, vec);
		vec.push_back(root->val);
		traversal(root->right, vec);

	}
};