leetcode字符串

5. 最长回文子串

class Solution {
public:
    string longestPalindrome(string s) {
        int n = s.size();
        if(n==0){
            return "";
        }
            
        vector<vector<int>>dp(n,vector<int>(n,0));
        string res;
        int maxlen =1;
        int start =0;
        for(int i = 0;i<n;i++){
            dp[i][i] = 1;
            for(int j = 0;j<i;j++){
                if(s[i]==s[j] &&((i-j<2) || dp[j+1][i-1]==1)){
                    dp[j][i] = 1;
                }
                

                if(dp[j][i]==1 && maxlen<(i-j+1)){
                    maxlen  = i-j+1;
                    start = j;
                }
            }

        }

        return s.substr(start,maxlen);

    }
};

93 DFS/回溯/递归

class Solution {
private:
    vector<int>seg = vector<int>(4,-1);
    vector<string>res;
public:
    void dfs (string& s ,int segId,int segstart)
    {
        // id到4的处理
        if(segId == 4){
            if(segstart == s.size()){
                string str = "";
                for(int i=0;i<4;i++){
                    str += to_string(seg[i]);
                    if(i !=  3){
                        str += '.';
                    }
                }
                res.push_back(str);                
            }
            return;
        }

        // 没找到
        if(segstart == s.size()){
            return;
        }
        //该位数的0开头，则只能用0作单独的
        if(s[segstart] == '0'){
            seg[segId] = 0;
            dfs(s,segId+1,segstart+1);
        }

        // 大部分情况
        int addr = 0;
        for(int segEnd = segstart;segEnd<s.size();segEnd++){
            addr = addr*10+ (s[segEnd]-'0');
            if(addr > 0 && addr < 256){
                seg[segId] = addr;
                dfs(s,segId+1,segEnd+1);
            }
            else{
                break;
            }

        }
    }
    vector<string> restoreIpAddresses(string s) {
        dfs(s,0,0);
        return res;
    }
};