leetcode算法杂选

string的split

std::vector<std::string> s_split(const std::string& in, const std::string& delim) {
    std::regex re{ delim };
    return std::vector<std::string> {
        std::sregex_token_iterator(in.begin(), in.end(), re, -1), std::sregex_token_iterator()
    };
}

求出排列组合所有项数值

int getAllValue(int m, int n){
    vector<int> dp(n+1);
    dp[0] = 1; dp[n] = 1;
    for(int i = 1; i <= (n + 1)/2; i++){
        dp[i] = dp[i-1] * (n-i +1) / i;
        dp[n-i] = dp[i];
    }
    return dp[m];
}

数字 字符串减法

string minuStrings(string num1, string num2) // 字符串减法
{
    if( num1.size() < num2.size() ){
        return minuStrings(num2 , num1);
    }else if(num1.size() == num2.size() && num1 < num2){
        return minuStrings(num2 , num1);
    }

    reverse(num1.begin(), num1.end());
    reverse(num2.begin(), num2.end());
    for(int i = 0; i < num2.size(); i++){
        if( num1[i] >= num2[i] ){
            num1[i] -= (num2[i] - '0');
        }else{
            int t = i+1;
            while(num1[t] == '0'){
                t++;
            }
            num1[t] -= 1;
            for(int j = i+1; j < t; j++){
                num1[j] = '9';
            }
            num1[i] += 10 - (num2[i] - '0');
        }
    }
    while(!num1.empty() && num1.back() == '0'){
        num1.pop_back();
    }
    reverse(num1.begin(), num1.end());
    return num1;
}