g0101_0200.s0131_palindrome_partitioning.Solution.cs Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

The newest version!

namespace LeetCodeNet.G0101_0200.S0131_palindrome_partitioning {

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
// #Backtracking #Big_O_Time_O(N*2^N)_Space_O(2^N*N)
// #2024_01_09_Time_677_ms_(38.30%)_Space_148_MB_(5.53%)

public class Solution {
    public IList> Partition(string s) {
        IList> res = new List>();
        Backtracking(res, new List(), s, 0);
        return res;
    }

    private void Backtracking(IList> res, IList currArr, string s, int start) {
        if (start == s.Length) {
            res.Add(new List(currArr));
        }
        for (int end = start; end < s.Length; end++) {
            if (!IsPanlindrome(s, start, end)) {
                continue;
            }
            currArr.Add(s.Substring(start, end - start + 1));
            Backtracking(res, currArr, s, end + 1);
            currArr.RemoveAt(currArr.Count - 1);
        }
    }

    private bool IsPanlindrome(string s, int start, int end) {
        while (start < end && s[start] == s[end]) {
            start++;
            end--;
        }
        return start >= end;
    }
}
}