17:15,开始今日工作,但愿能今天搞定,先做一题然后去吃饭。
654.最大二叉树
要考虑那个index是不是顶头,顶头的话,那一侧就是nullptr了。
/**
* 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) {
if(nums.size() == 1){
TreeNode* node = new TreeNode(nums[0]);
return node;
}
int maxValue = 0;
int maxValueIndex = 0;
for(int i = 0;i< nums.size();i++){
if(nums[i] > maxValue){
maxValueIndex = i;
maxValue = nums[i];
}
}
TreeNode* root = new TreeNode(maxValue);
//要判断左右区间是不是顶头!!!
if(maxValueIndex > 0){
vector<int>left_nums(nums.begin(),nums.begin()+maxValueIndex);
root->left = constructMaximumBinaryTree(left_nums);
}
if(maxValueIndex< nums.size() - 1){
vector<int>right_nums(nums.begin()+maxValueIndex+1,nums.end());
root->right = constructMaximumBinaryTree(right_nums);
}
return root;
}
};
用脚标会容易,因为可以left > right的时候return nullptr;
617.合并二叉树
/**
* 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* t1, TreeNode* t2) {
if(t1 == nullptr) return t2;
if(t2 == nullptr) return t1;
t1->val += t2->val; //中
t1->left = mergeTrees(t1->left,t2->left); //左
t1->right = mergeTrees(t1->right,t2->right); //右
return t1;
}
};
t1没有返t2,t2没有返t1
700.二叉搜索树中的搜索
搜索树是有序的
- 若它的左子树不空,则左子树上所有结点的值均小于它的根结点的值;
- 若它的右子树不空,则右子树上所有结点的值均大于它的根结点的值;
- 它的左、右子树也分别为二叉搜索树
/**
* 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) {
if(root == nullptr || root->val == val)return root;
if(root->val > val)return searchBST(root->left,val);
if(root->val < val)return searchBST(root->right,val);
return nullptr;
}
};
迭代法也很快乐,因为有序,不需要栈(深度)或者队列(广度),不需要回溯
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
while (root != NULL) {
if (root->val > val) root = root->left;
else if (root->val < val) root = root->right;
else return root;
}
return NULL;
}
};
98.验证二叉搜索树
转化成数组来判断
/**
* 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:
vector<int>vec;
void traversal(TreeNode *node){
if(!node)return;
if(node->left)traversal(node->left);
vec.push_back(node->val);
if(node->right)traversal(node->right);
}
bool isValidBST(TreeNode* root) {
vec.clear();
traversal(root);
for(int i = 1;i<vec.size();i++){
if(vec[i] <= vec[i-1])return false;//一定是小于等于,因为搜索树没有相等
}
return true;
}
};
直接比较,取到最左面的节点,然后开始比较,这个最左面值的取值方法要记住。中序遍历,左中右,实际上这样能得到最左面的值。
class Solution {
public:
TreeNode* pre = NULL; // 用来记录前一个节点
bool isValidBST(TreeNode* root) {
if (root == NULL) return true;
bool left = isValidBST(root->left);
if (pre != NULL && pre->val >= root->val) return false;
pre = root; // 记录前一个节点
bool right = isValidBST(root->right);
return left && right;
}
};
迭代法有点复杂,留着吧,目前决定理解即可
class Solution {
public:
bool isValidBST(TreeNode* root) {
stack<TreeNode*> st;
TreeNode* cur = root;
TreeNode* pre = NULL; // 记录前一个节点
while (cur != NULL || !st.empty()) {
if (cur != NULL) {
st.push(cur);
cur = cur->left; // 左
} else {
cur = st.top(); // 中
st.pop();
if (pre != NULL && cur->val <= pre->val)
return false;
pre = cur; //保存前一个访问的结点
cur = cur->right; // 右
}
}
return true;
}
};
结束结束,明日开始上班。