Day51 单调栈

最新推荐文章于 2024-07-13 19:27:27 发布

DuanDuan0820

最新推荐文章于 2024-07-13 19:27:27 发布

阅读量53

点赞数

分类专栏：算法学习文章标签： c++ 算法 leetcode 数据结构

本文链接：https://blog.csdn.net/DuanDuan0820/article/details/131268910

版权

算法学习专栏收录该内容

52 篇文章 0 订阅

订阅专栏

503. 下一个更大元素 II

class Solution {
public:
    void printStack(std::stack<int> s) {
        while (!s.empty()) {
            std::cout << s.top() << " ";
            s.pop();
        }
        std::cout << std::endl;
    }

    vector<int> nextGreaterElements(vector<int>& nums) {
        vector<int> ret(nums.size(), -1);
        if (nums.size() <= 1) return ret;

        stack<int> s;
        s.push(0);

        for (int i = 1; i < nums.size() * 2; i++) {
            int index = i % nums.size();
            if (nums[index] <= nums[s.top()]) {
                s.push(index);
            } else {
                while( !s.empty() && nums[index] > nums[s.top()]) {
                    ret[s.top()] = nums[index];
                    s.pop();
                }
                s.push(index);
            }
            // printStack(s);
        }

        return ret;
    }
};

42. 接雨水

class Solution {
public:
    int trap(vector<int>& height) {
        if(height.size() <= 2) return 0;
        stack<int> s;
        s.push(0);

        int sum = 0;
        for (int i = 1; i < height.size(); i++) {
            if (height[i] <= height[s.top()]) {
                s.push(i);
            } else {
                while ( !s.empty() && height[i] > height[s.top()]) {
                    int mid = s.top();
                    s.pop();
                    if ( !s.empty() ) {
                        int h = std::min(height[i], height[s.top()]) - height[mid];
                        int w = i - s.top() - 1;
                        sum += h * w;
                        // std::cout << sum << std::endl;
                    }
                }
                s.push(i);
            }
        }
        
        return sum; 
    }

    void printVector(const std::vector<int>& vec) {
        for (const auto& element : vec) {
            std::cout << element << " ";
        }
        std::cout << std::endl;
    }
    
    /*
        @brief: 双指针
    int trap(vector<int>& height) {
        if (height.size() <= 2) return 0;

        vector<int> max_left_vec(height.size(), 0);
        vector<int> max_right_vec(height.size(), 0);

        max_left_vec[0] = height[0];
        for (int i = 1; i < height.size(); i++) {
            max_left_vec[i] = std::max(height[i], max_left_vec[i-1]);
        }

        // printVector(max_left_vec);

        max_right_vec[height.size() - 1] = height[height.size() - 1];
        for (int i = height.size() - 2; i >= 0; i--) {
            max_right_vec[i] = std::max(height[i], max_right_vec[i + 1]);
        }
        // printVector(max_right_vec);

        int sum = 0;
        for (int i = 0; i < height.size(); i++) {
            int count = min(max_left_vec[i], max_right_vec[i]) - height[i];
            // std::cout << "count: " << count << ", i: " << i 
            //           << ", max_left_vec[i]: " << max_left_vec[i] 
            //           << ", max_right_vec[i]: " << max_right_vec[i] 
            //           << ", height[i]: " << height[i] 
            //           << std::endl;
            if (count > 0) sum += count;
        }

        return sum;
    }
    */
};