LintCode 1378: Minimum String Array Coverage (同向双指针经典题)

最新推荐文章于 2024-11-04 19:24:37 发布

纸上得来终觉浅绝知此事要躬行

最新推荐文章于 2024-11-04 19:24:37 发布

阅读量177

点赞数

分类专栏： algorithm-design 文章标签：字符串算法 c++

本文链接：https://blog.csdn.net/roufoo/article/details/104006414

版权

algorithm-design 专栏收录该内容

817 篇文章 4 订阅

订阅专栏

Minimum String Array Coverage

Given a string collection tag_list, an array of strings all_tags, find the smallest all_tags sub-array contains all the string in the tag_list, output the length of this sub-array. If there is no return -1.

Example
Example1

Input: tag_list = [“made”,“in”,“china”], all_tags = [“made”, “a”,“b”,“c”,“in”, “china”,“made”,“b”,“c”,“d”]
Output: 3
Explanation:
[“in”, “china”,“made”] contains all the strings in tag_list,6 - 4 + 1 = 3.
Example2

Input: tag_list = [“a”], all_tags = [“b”]
Output: -1
Explanation:
Does not exist.
Notice
1 <= |tag_list|,|all_tags| <=10000
All string length <= 50
String is not repeated in tag_list

解法1：
双指针法。p2先往右移动，直到包含所有目标字符串。
然后p1往右移动，同时调整hashmap的值。如果窗口中的目标字符串都在的话，p1会一直移到p2，直到窗口中的目标字符串不全，此时p1停下，p2继续往右移动。
代码同步更新在https://github.com/luqian2017/Algorithm

class Solution {
public:
    /**
     * @param tagList: The tag list.
     * @param allTags: All the tags.
     * @return: Return the answer
     */
    int getMinimumStringArray(vector<string> &tagList, vector<string> &allTags) {
        int m = tagList.size();
        int n = allTags.size();
        if (m > n) return -1;
        
        int p1 = 0, p2 = 0;
        map<string, int> mp;
        for (int i = 0; i < m; ++i) mp[tagList[i]] = 0;
        int matchWordCount = 0;
        int minLen = INT_MAX;

        //move p2
        while(p2 < n) {
            if (mp.find(allTags[p2]) != mp.end()) {
                mp[allTags[p2]]++;
                if (mp[allTags[p2]] == 1) matchWordCount++;
                if (matchWordCount == m) {
                    minLen = min(minLen, p2 - p1 + 1);   
                    //move p1 to right
                    while(p1 < p2) {
                        if (mp.find(allTags[p1]) != mp.end()) {
                             mp[allTags[p1]]--;
                             if (mp[allTags[p1]] == 0) {
                                 matchWordCount--;
                                 p1++;
                                 break;
                             }
                        }
                        p1++;
                        minLen = min(minLen, p2 - p1 + 1);
                    }
                } 
            }
            p2++;
        }
      
        return minLen == INT_MAX ? -1 : minLen;
    }
};