leetcode 131. Palindrome Partitioning

class Solution {public:vector<vector<string>> partition(string s){if (s.empty()){return{};}process(0, s);return res;}private:vector<vector<string>> res;vector<string> temp;void process(int start, string& s){if (start == s.size()){res.push_back(temp);return;}for (int i = start; i < s.size(); i++){if (isPalindrome(s, start, i)){temp.push_back(s.substr(start, i - start + 1));process(i + 1, s);temp.pop_back();}}}bool isPalindrome(string &s, int start, int end){while (start <= end){if (s[start++] != s[end--]){return false;}}return true;}};