zoukankan      html  css  js  c++  java
  • 一维maxpooling

    index存储的是下标

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

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

  • 相关阅读:
    hdu5249
    hdu5673-Robot
    hihoCoder 1033
    simpleOS 1.0
    hdu3511-Prison Break
    单调栈
    关于每次取PC的值为PC+4的问题
    hdu3652
    Linux MySQL5.7.18安装手册
    Linux MySQL5.6.36安装手册
  • 原文地址:https://www.cnblogs.com/ymjyqsx/p/9678296.html
Copyright © 2011-2022 走看看