LeetCode 30 Substring with Concatenation of All Words

题目

食之无味的题目

class Solution {
public:
    map m;
    map m2;
    map m3;
    int b[100005];
    int c[100005];
    vector findSubstring(string s, vector& words) {
        
        
        vector ans;
        if(words.size()==0)
            return ans;
        if(s.length()==0)
            return ans;
         for(int i=0;im[m2[c[k]]])
                     {
                         tag=0;
                         break;
                     }
                     else
                     {
                         x++;
                         j=k;
                         k++;
                         if(x==words.size())
                         {
                             tag=1;
                             break;
                         }
                     }
                 }
                 else{
                     break;
                 }
             }
             if(x