刷题记录（Palindrome Partitioning）

Leecode：Palindrome Partitioning（JS解答）

思路：先用动态规划存储dp【left】【right】是否是回文，表示从字符s的left位置到right位置这串字符是否是回文,让后使用回溯的方法进行遍历

function partition(s: string): string[][] {
       var res:string[][] = [];
        var len:number = s.length;
        if(len === 0) return res;
        var dp:boolean[][] = new Array(len);
        for (var i = 0; i < dp.length; i++){
            var temp:boolean[] = new Array(len).fill(false)
            dp[i] = temp;
        }
        for(var right = 0; right < len; right++){
            for(var left = 0; left <= right; left++){
                if(s.charAt(left) === s.charAt(right) && (right-left <= 2 || dp[left+1][right-1])){
                    console.log(left,right)
                    dp[left][right] = true;
                }
            }
        }
        var path:string[] = [];
        helper(s,0,len,dp,path,res);
        return res;
};

function helper(s:string,start:number,len:number,dp:boolean[][],path:string[],res:string[][]){
        if(start === len){
            res.push([...path]);
            return
        }
        for(var i = start; i < len; i++){
            if(!dp[start][i]) continue;
            path.push(s.slice(start,i+1));
            helper(s,i+1,len,dp,path,res);
            path.pop();
        }
    }