Leetcode 140 Word Break II（DFS+dp）

题目连接：Leetcode 140 Word Break II

解题思路：递归遍历，每次枚举一个词，并且在剩下的位置可被切割的情况递归，作为剪枝。

class Solution {
	public:
		bool dfs(int d, string s, string t, vector<string>& wordDict, vector<string>& ans, bool* dp) {
			if (d >= s.size()) {
				ans.push_back(t);
				return true;
			}
			bool ret = false;

			for (int i = 0; i < wordDict.size(); i++) {
				int n = wordDict[i].size();
				if (s.substr(d, n) == wordDict[i] && dp[d+n]) {

					string tmp = t + (t == "" ? wordDict[i] : " " + wordDict[i]);
					if (dfs(d + n, s, tmp, wordDict, ans, dp)) ret = true;
					else dp[d+n] = false;
				}
			}
			return ret;
		}

		vector<string> wordBreak(string s, vector<string>& wordDict) {
			vector<string> ans;

			int m = s.size();
			bool* dp = new bool[m+1];
			for (int i = 0; i <= m; i++) dp[i] = true;

			dfs(0, s, "", wordDict, ans, dp);

			delete[] dp;
			return ans;
		}
};