CODE 137: 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", "and", "sand", "dog"].

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

public ArrayList<String> wordBreak(String s, Set<String> dict) {
		// IMPORTANT: Please reset any member data you declared, as
		// the same Solution instance will be reused for each test case.
		Set<String> unused = new HashSet<String>();
		boolean touched = false;
		Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>();
		for (String dic : dict) {
			if (!s.contains(dic)) {
				unused.add(dic);
			}
		}
		dict.removeAll(unused);

		for (int i = 0; i < s.length(); i++) {
			for (String sub : dict) {
				String subTmp = s.substring(i);
				int start = i;
				while (subTmp.contains(sub)) {
					int index = subTmp.indexOf(sub);
					if (map.containsKey(start + index)) {
						map.get(start + index)
								.add(start + index + sub.length());
					} else {
						map.put(start + index, new HashSet<Integer>());
						map.get(start + index)
								.add(start + index + sub.length());
					}
					subTmp = subTmp.substring(index + sub.length());
					start = start + index + sub.length();
					if (start >= s.length()) {
						touched = true;
					}
				}
			}
		}
		if (!touched) {
			return new ArrayList<String>();
		}

		return wbreak(s, s.length(), map, 0);
	}

	ArrayList<String> wbreak(String s, int length,
			Map<Integer, Set<Integer>> map, int x) {
		if (!map.containsKey(x)) {
			return new ArrayList<String>();
		}
		ArrayList<String> results = new ArrayList<String>();
		for (int index : map.get(x)) {
			String subString = s.substring(x, index);
			if (index >= length) {
				results.add(subString);
			} else {
				ArrayList<String> subResults = wbreak(s, length, map, index);
				if (subResults.isEmpty()) {
					continue;
				} else {
					for (String subResult : subResults) {
						String result = subString + " " + subResult;
						results.add(result);
					}
				}
			}
		}
		return results;
	}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值