478-82（56、128、718、129）

56. 合并区间

class Solution {
public:
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        
        vector<vector<int>> res;

        int length = intervals.size();
        if (length == 0)  return res;

        sort(intervals.begin(), intervals.end(),
            [](const vector<int>& a, const vector<int>& b)->bool
            {
                return a[0] < b[0];
            }
        );

        int flag = false;

        for (int i = 1; i < length; i++)
        {
            int start = intervals[i - 1][0];
            int end = intervals[i - 1][1];

            while (i < length && intervals[i][0] <= end)
            {
                end = std::max(end, intervals[i][1]);
                if (i == length - 1) flag = true;
                i++;
            }
            res.push_back({ start, end });
        }
        if (flag == false)
        {
            res.push_back({ intervals[length - 1][0], intervals[length - 1][1] });
        }

        return res;
    }
};

128. 最长连续序列

class Solution {
public:
    int longestConsecutive(vector<int>& nums) {
        unordered_set<int> hash;
        for (const auto& n : nums)
        {
            hash.insert(n);
        }

        int res = 0;

        for (const auto& x : hash)
        {
            if (!hash.count(x - 1))//x的前面没有数了，即找每个分段最小的
            {
                int y = x;
                while (hash.count(y + 1)) y++;
                res = std::max(res, y - x + 1);
            }
        }
        return res;
    }
};

718. 最长重复子数组

class Solution {
public:
    int findLength(vector<int>& nums1, vector<int>& nums2) {
        int m = nums1.size();
        int n = nums2.size();

        vector<vector<int>> dp(m + 1, vector<int>(n+1, 0));
        int res = 0;

        for(int i = 1; i <= m; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                if(nums1[i-1] == nums2[j-1])
                {
                    dp[i][j] = dp[i-1][j-1] + 1;
                }

                res = std::max(dp[i][j], res);
            }
        }
        return res;
    }
};

129. 求根节点到叶节点数字之和

class Solution {
public:
    int dfs(TreeNode* root, int sum)
    {
        if (root == nullptr) return 0;

        sum = 10 * sum + root->val;

        if (root->left == nullptr && root->right == nullptr)
        {
            return sum;
        }
        else
        {
            return dfs(root->left, sum) + dfs(root->right, sum);
        }
    }
public:
    int sumNumbers(TreeNode* root) {
        return dfs(root, 0);
    }
};