Substring with Concatenation of All Words

78 篇文章 0 订阅
68 篇文章 0 订阅

参考小莹子同学的点击打开链接

自己刚才一直在纠结这段code,其实就是保证还剩下最后一个当前满足条件的word能留下。

if (curDict.get(temp) < dict.get(temp)) {
                            count--;
                        }

ArrayList<Integer> list = findSubstring("barfoofoobarthefoobarman", new String[]{"foo", "bar","the"});

用这个测一下吧。

public class Solution {
    public List<Integer> findSubstring(String s, String[] words) {
        List<Integer> res = new LinkedList<>();
        if (s == null || s.length() == 0 || words == null || words.length == 0) {
            return res;
        }
        int num = words.length;
        Map<String, Integer> dict = new HashMap<>();
        for (String word: words) {
            if (dict.containsKey(word)) {
                dict.put(word, dict.get(word) + 1);
            } else {
                dict.put(word, 1);
            }
        }
        int wordLen = words[0].length();
        for (int i = 0; i < wordLen; i++) {
            int index = i;
            int count = 0;
            Map<String, Integer> curDict = new HashMap<>();
            //for (int j = i; j < s.length() - wordLen; j = j + wordLen) {
            for (int j = i; j <= s.length() - wordLen; j = j + wordLen) {
                String word = s.substring(j, j + wordLen);
                if (!dict.containsKey(word)) {
                    //index = j;
                    index = j + wordLen;
                    curDict.clear();
                    count = 0;
                    continue;
                }
                
                if (curDict.containsKey(word)) {
                    curDict.put(word, curDict.get(word) + 1);
                } else {
                    curDict.put(word, 1);
                }
                if (curDict.get(word) <= dict.get(word)) {
                    count++;
                } else {
                    while (curDict.get(word) > dict.get(word)) {
                        String temp = s.substring(index, index + wordLen);
                        curDict.put(temp, curDict.get(temp) - 1);
                        if (curDict.get(temp) < dict.get(temp)) {
                            count--;
                        }
                        index = index + wordLen;
                    }
                }
                if (count == num) {
                    res.add(index);
                    String temp = s.substring(index, index + wordLen);
                    curDict.put(temp, curDict.get(temp) - 1);
                    count--;
                    index = index + wordLen;
                }
            }
        }
        return res;
    }
}




  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值