【LeetCode】 88 串联所有单词的子串

题目：

解题思路：

一个是哈希表是 words，一个哈希表是截取的字符串，比较两个哈希是否相等！

滑动窗口

https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words/solution/chuan-lian-suo-you-dan-ci-de-zi-chuan-by-powcai/

https://www.bilibili.com/video/BV15441127FS?from=search&seid=15196280111202959649

代码：

package com.janeroad;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;

/**
 * Created on 2020/11/5.
 *
 * [@author](https://my.oschina.net/arthor) LJN
 */
public class LC120 {

        public static List<Integer> findSubstring(String s, String[] words) {
            List<Integer> res = new ArrayList<>();
            if (s == null || s.length() == 0 || words == null || words.length == 0) return res;
            HashMap<String, Integer> map = new HashMap<>();
            int one_word = words[0].length();
            int word_num = words.length;
            int all_len = one_word * word_num;
            for (String word : words) {
                map.put(word, map.getOrDefault(word, 0) + 1);
            }
            for (int i = 0; i < one_word; i++) {
                int left = i, right = i, count = 0;
                HashMap<String, Integer> tmp_map = new HashMap<>();
                while (right + one_word <= s.length()) {
                    String w = s.substring(right, right + one_word);
                    right += one_word;
                    if (!map.containsKey(w)) {
                        count = 0;
                        left = right;
                        tmp_map.clear();
                    } else {
                        tmp_map.put(w, tmp_map.getOrDefault(w, 0) + 1);
                        count++;
                        while (tmp_map.getOrDefault(w, 0) > map.getOrDefault(w, 0)) {
                            String t_w = s.substring(left, left + one_word);
                            count--;
                            tmp_map.put(t_w, tmp_map.getOrDefault(t_w, 0) - 1);
                            left += one_word;
                        }
                        if (count == word_num) res.add(left);
                    }
                }
            }
            return res;
        }

    public static void main(String[] args) {
            String s = "nowcoderacodnowert";
            String[] words = new String[]{"now", "cod"};
        List<Integer> substring = findSubstring(s, words);
        for (int i = 0; i < substring.size(); i++) {
            System.out.println(substring.get(i));
        }

    }
}