leetcode算法 - Word Break II js实现

题目如下：
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.

Return all such possible sentences.

For example, given
s = "catsanddog",
dict = ["cat", "cats", "and", "sand", "dog"].

A solution is ["cats and dog", "cat sand dog"].

思路：用数组构造一个hashmap，用数组模拟栈模型， 用栈模型实现dps（深度优先算法）。

核心代码：

function solve(start){    var childMap=map[hash(start)];    var childMapLength=childMap.length;    for(var i=0;i<childMapLength;i++){        stack.push(childMap[i]);        if(childMap[i].finish===s.length){  //正确答案            answer.push(stringify(stack))        }else{            solve(childMap[i].finish);     //递归        }        stack.pop();    }}solve(0);

测试结果dict:

s=“abcdefghijk”

result:

				


				
时间： 2024-08-03 00:18:26 

		


		


	

	
	

		


		
leetcode算法 -  Word Break II   js实现的相关文章


								

		

			

                【leetcode】Word Break II
			

		

		

									

				Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens = "catsanddog",dict = ["cat", "cats"			

		

	

				

		

			

                Leetcode dfs Word Break II
			

		

		

									

				Word Break II Total Accepted: 15138 Total Submissions: 92228My Submissions Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For ex			

		

	

				

		

			

                leetcode[140] Word Break II
			

		

		

									

				这题是上一题的加强版,这里需要返回的是所有可能的分割词.例如: s = "catsanddog",dict = ["cat", "cats", "and", "sand", "dog"]. A solution is ["cats and dog", "cat sand dog"]. 先用dp求得每个起点到终点是否符合word break 1中的条			

		

	

				

		

			

                [C++]LeetCode: 113 Word Break II (DP &amp;&amp; Backtacking) 求解拆分组合
			

		

		

									

				题目: Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, given s = "catsanddog", dict = ["cat", "cats			

		

	

				

		

			

                【LeetCode】Word Break II 动态规划
			

		

		

									

				题目:Word Break 要求找到所有能够有字典中的词重组成目标串的结果 public class Solution { public static List<String> wordBreak(String s, Set<String> dict) { List<String> dp[] = new ArrayList[s.length()+1]; dp[0] = new ArrayList<String>(); for(int i=0; i<s.			

		

	

				

		

			

                [Leetcode][JAVA] Word Break II
			

		

		

									

				Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens = "catsanddog",dict = ["cat", "cats"			

		

	

				

		

			

                【LeetCode】Word Break II 解题报告
			

		

		

									

				Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, given s = "catsanddog", dict = ["cat", "cats&quo			

		

	

				

		

			

                leetcode 140. Word Break II ----- java
			

		

		

									

				Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens = "catsanddog",dict = ["cat", "cats"			

		

	

				

		

			

                【leetcode】Word Break II (hard)★
			

		

		

									

				Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens = "catsanddog",dict = ["cat", "cats"