【LeetCode】Palindrome Partitioning

class Solution {
public:
 void dfs(string s, vector<string> &path, vector<vector<string>> &result)
{
	if (s.size() < 1)
	{
		result.push_back(path);
		return;
	}
	for (int i = 0; i < s.size(); i++)
	{
		int begin = 0;
		int end = i;
		while (begin < end)
		{
			if (s[begin] == s[end])
			{
				begin++;
				end--;
			}
			else
				break;
		}
		if (begin>=end)
		{
			path.push_back(s.substr(0, i + 1));
			dfs(s.substr(i + 1), path, result);
			path.pop_back();
		}
	}
}
vector<vector<string>> partition(string s)
{
	vector<vector<string>> result;
	vector<string> path;
	dfs(s, path, result);
	return result;
}
};