一维maxpooling

index存储的是下标

vector<int> maxpooling(vector<int> num,int size){
    vector<int> result;
    int length = num.size();
    if(length <=  || length < size || size <= )
        return result;
    deque<int> index;
    for(int i = ;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

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