475-82（230、43、78、79、213、198、1143）

230. 二叉搜索树中第K小的元素

class Solution {
private:
    vector<int> res;

    void traversal(TreeNode* root)
    {
        if (root == nullptr)
        {
            return;
        }
        traversal(root->left);
        res.push_back(root->val);
        traversal(root->right);
    }
public:
    int kthSmallest(TreeNode* root, int k) {
        traversal(root);

        return res[k - 1];
    }
};

43. 字符串相乘

class Solution {
public:
    string multiply(string num1, string num2) {
        string res;

        int m = num1.size();
        int n = num2.size();

        vector<int>ans((m + n), 0);

        for (int i = m - 1; i >= 0; --i)
        {
            for (int j = n - 1; j >= 0; j--)
            {
                int n1 = num1[i] - '0';
                int n2 = num2[j] - '0';

                int temp = n1 * n2;

                temp += ans[i + j + 1];
                ans[i + j + 1] = temp % 10;
                ans[i + j] += temp / 10;
            }
        }

        for (int i = 0; i < m + n; i++)
        {
            if (res.size() == 0 && ans[i] == 0)  continue;
            char ch = ans[i] + '0';
            res += ch;
        }

        return res.size() == 0 ? "0" : res;

    }
};

78. 子集

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;

    void backtracking(vector<int>& nums, int index)
    {
        res.push_back(path);

        if (nums.size() == index)
        {
            return;
        }

        for (int i = index; i < nums.size(); i++)
        {
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }
    }

public:
    vector<vector<int>> subsets(vector<int>& nums) {
        res.clear();
        path.clear();

        backtracking(nums, 0);
        return res;
    }
};

79. 单词搜索

class Solution {
private:
    int m, n;
    int vaild[6][6];

    bool dfs(vector<vector<char>>& board, string word, int len, int i, int j, int index)
    {
        if (index == len)    return true;

        if (i - 1 >= 0 && board[i - 1][j] == word[index] && !vaild[i - 1][j])
        {
            vaild[i - 1][j] = 1;
            if (dfs(board, word, len, i - 1, j, index + 1))
            {
                return true;
            }
            vaild[i - 1][j] = 0;
        }

        if (i + 1 < m && board[i + 1][j] == word[index] && !vaild[i + 1][j])
        {
            vaild[i + 1][j] = 1;
            if (dfs(board, word, len, i + 1, j, index + 1))
            {
                return true;
            }
            vaild[i + 1][j] = 0;
        }

        if (j - 1 >= 0 && board[i][j - 1] == word[index] && !vaild[i][j - 1])
        {
            vaild[i][j - 1] = 1;
            if (dfs(board, word, len, i, j - 1, index + 1))
            {
                return true;
            }
            vaild[i][j - 1] = 0;
        }

        if (j + 1 < n && board[i][j + 1] == word[index] && !vaild[i][j + 1])
        {
            vaild[i][j + 1] = 1;
            if (dfs(board, word, len, i, j + 1, index + 1))
            {
                return true;
            }
            vaild[i][j + 1] = 0;
        }
        return false;
    }

public:
    bool exist(vector<vector<char>>& board, string word) {
        m = board.size();
        n = board[0].size();

        int len = word.size();
        memset(vaild, 0, sizeof(vaild));

        if (n * m < len)  return false;

        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (board[i][j] == word[0])
                {
                    vaild[i][j] = 1;
                    if (dfs(board, word, len, i, j, 1))
                    {
                        return true;
                    }
                    vaild[i][j] = 0;
                }
            }
        }
        return false;
    }
};

213. 打家劫舍 II

class Solution {
public:
    int rob(vector<int>& nums) {
        if (nums.size() == 0)    return 0;
        if (nums.size() == 1)    return nums[0];

        int res1 = rob_range(nums, 0, nums.size() - 2);
        int res2 = rob_range(nums, 1, nums.size() - 1);

        return max(res1, res2);
    }

    int rob_range(vector<int>& nums, int start, int end)
    {
        if (end == start)    return nums[start];

        vector<int> dp(nums.size(), 0);

        dp[start] = nums[start];
        dp[start + 1] = std::max(nums[start], nums[start + 1]);

        for (int i = start + 2; i <= end; i++)
        {
            dp[i] = std::max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        return dp[end];
    }
};

198. 打家劫舍

class Solution {
public:
    int rob(vector<int>& nums) {
        if (nums.size() == 0) return 0;
        if (nums.size() == 1)    return nums[0];

        //dp[i]：考虑下标i（包括i）以内的房屋，最多可以偷窃的金额为dp[i]。
        vector<int> dp(nums.size(), 0);
        dp[0] = nums[0];
        dp[1] = std::max(nums[0], nums[1]);

        for (int i = 2; i < nums.size(); i++)
        {
            dp[i] = std::max(dp[i - 1], dp[i - 2] + nums[i]);
        }

        return dp[nums.size() - 1];
    }
};

1143. 最长公共子序列

class Solution {
public:
    int longestCommonSubsequence(string text1, string text2) {
        //状态表示： 定义 f[i][j]表示字符串text1的[1,i]区间和字符串text2的[1,j]区间的最长公共子序列长度（下标从1开始）。

        int m = text1.size();
        int n = text2.size();

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

        for (int i = 1; i <= m; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (text1[i - 1] == text2[j - 1])
                {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }
                else
                {
                    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }
        return dp[m][n];
    }
};