字符串--算法

最新推荐文章于 2021-09-06 18:24:12 发布

kylin_xue

最新推荐文章于 2021-09-06 18:24:12 发布

阅读量158

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/kylin_xue/article/details/105074262

版权

算法专栏收录该内容

8 篇文章 0 订阅

订阅专栏

迭代

滑动窗口

boolean isAnagram(String s, String t) {
    if(s.length() != t.length()) return false;
    HashMap<Character, Integer> map = new HashMap<>();
    char[] chs = t.toCharArray();
    for (int i = 0; i < chs.length; i++) {
        map.put(chs[i], map.getOrDefault(chs[i], 0) + 1);
    }
    int diff = t.length();
    char[] cs = s.toCharArray();
    for (int i = 0; i < cs.length; i++) {
        if (map.containsKey(cs[i]) && map.get(cs[i])>0) {
            map.put(cs[i], map.get(cs[i]) - 1);
            diff--;
        }
    }
    return diff==0;
}

// 76 minimum window substring
String minWindow(String s, String t) {
    int slen = s.length();
    int tlen = t.length();
    if (slen < tlen || tlen==0) {
        return "";
    }
    HashMap<Character, Integer> tFreq = new HashMap<>();
    HashMap<Character, Integer> window = new HashMap<>();
    // 初始化 tFreq
    for (int i = 0; i < tlen; i++) {
        tFreq.put(t.charAt(i), tFreq.getOrDefault(t.charAt(i), 0) + 1);
    }
    int left = 0;
    int right = -1;   // [left, right]
    int match = 0;
    int minL = Integer.MAX_VALUE;
    int start = -1;
    while (right + 1 < slen) {
        right ++;
        char c = s.charAt(right);
        if (tFreq.containsKey(c)) {
            window.put(c, window.getOrDefault(c, 0)+1);
            if (window.get(c) == tFreq.get(c)) {
                match++;
            }
        }
        while (match == tFreq.size()) {
            if (right - left + 1 < minL) {
                minL = right-left+1;
                start = left;    // 记录最小覆盖串的起始位置
            }
            char ch = s.charAt(left++);
            if (tFreq.containsKey(ch)) {
                window.put(ch, window.get(ch) - 1);  // left移动
                if (window.get(ch) < tFreq.get(ch)) {
                    match--;
                }
            }
        }
    }
    return s.substring(start, start+minL);
}

// 438 find all anagrams in a string
public List<Integer> findAnagrams(String s, String p) {
    List<Integer> res = new ArrayList<>();
    int slen = s.length();
    int plen = p.length();
    if (slen < plen) {
        return res;
    }
    HashMap<Character, Integer> pdict = new HashMap<>();
    HashMap<Character, Integer> window = new HashMap<>();
    for (int i = 0; i < plen; i++) {
        char c = p.charAt(i);
        pdict.put(c, pdict.getOrDefault(c, 0) + 1);
    }
    int match = 0;
    int left = 0, right = -1;
    while (right + 1 < slen) {
        char c = s.charAt(++right);
        if (pdict.containsKey(c)) {
            window.put(c, window.getOrDefault(c, 0) + 1);
            if (window.get(c) == pdict.get(c)) {
                match++;
            }
        }
        while (match == pdict.size()) {
            if(right - left + 1 == plen)
                res.add(left);
            char ch = s.charAt(left++);
            if (pdict.containsKey(ch)) {
                window.put(ch, window.get(ch)-1);
                // window中的ch可能会多余pdict中的
                // 从相等 -> window中的ch变少,匹配的字符减一
                if (window.get(ch) < pdict.get(ch)) {  
                    match--;
                }
            }
        }
    }
    return res;
}