Leetcode 动态规划 139 // 11 43

139. Word Break

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
        unordered_set<string> record(wordDict.begin(), wordDict.end());
        vector<bool> dp(s.size()+1, false);

        dp[0] = true;

        for(int i=1; i<=s.size(); i++){
            for(int j=0; j<i; j++){
                string word = s.substr(j, i-j);
                if(record.find(word) != record.end() && dp[j]){
                    dp[i] = true;
                }
            }
        }

        return dp[s.size()];
    }
};

11. Container With Most Water

class Solution {
public:
    int maxArea(vector<int>& height) {
        int maxA = 0;
        int sum = 0;
        int left = 0, right = height.size()-1;

        while(left < right){
            sum = min(height[left], height[right]) *(right-left);
            maxA = max(maxA, sum);
            if(height[left] <= height[right]){
                left++;
            }else{
                right--;
            }
        }

        return maxA;
    }
};

43. Multiply Strings

class Solution {
public:
    string multiply(string num1, string num2) {
        int m = num1.size();
        int n = num2.size();
        vector<int> res(m+n,0);

        for(int i=m-1; i>=0; i--){
            for(int j=n-1; j>=0; j--){
                int mul = (num1[i]-'0')*(num2[j]-'0');
                int p1 = i+j+1;
                int p2 = i+j;
                int sum = mul+res[p1];
                res[p1] = sum%10;
                res[p2] += sum/10;
            }
        }

        int i=0;
        while(i<res.size() && res[i] == 0)
            i++;
        string str;
        for(;i<res.size();i++){
            str.push_back(res[i]+'0');
        }

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

    }
};

1.不能直接相乘，会溢出，要模拟每位数相乘的步骤

2.一定要明确数组的哪一端是个位数，哪一端是大的，这里个位数是数组最大编码的值

这样比较好判断0，在数组前面的0是不需要进入string结果的

3.明确什么时候是数字，什么时候是char,char/int互换要  +-‘0’

4.最后还要判断特殊结果，即结果为0

5.模拟每一步的时候，要记得加上之前的值