index存储的是下标

 

vector
     
       maxpooling(vector
      
        num,int size){    vector
       
         result;    int length = num.size();    if(length <= 0 || length < size || size <= 0)        return result;    deque
        
          index;    for(int i = 0;i < size;i++){        while(!index.empty() && num[i] <= num[index.back()]){            index.pop_back();        }        index.push_back(i);    }    for(int i = size;i < length;i++){        result.push_back(num[index.front()]);        while(!index.empty() && num[i] <= num[index.back()])            index.pop_back();        while(!index.empty() && index.front <= i - size)            index.pop_front();        index.push_back(i);    }    result.push_back(num[index.front()]);    return result;}
        
       
      
     

https://blog.csdn.net/siyue0211/article/details/80959352

看一下我的代码和这个博客里面的代码，人家的工程优化用的多好，学习