Leetcode/leetcode131.cpp at main · ksaini-web/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
class Solution {
public:
bool ispalin(string s){
    string s1=s;
    reverse(s1.begin(),s1.end());
   return s==s1;
}

 void getAllparts(string s,vector<string>&partitions, vector<vector<string>> &ans){

    if(s.size()==0){
      ans.push_back( partitions);
      return;
    }


    for(int i=0;i<s.size();i++){

        string part= s.substr(0,i+1);

             if(ispalin(part)){
                partitions.push_back(part);

               getAllparts(s.substr(i+1),partitions,ans);
                partitions.pop_back();

             }


    }}


    vector<vector<string>> partition(string s) {

        vector<vector<string>> ans;
        vector<string>partitions;

        getAllparts(s,partitions,ans);
        return ans;


    }
};