LeetCode_42_接雨水

双指针超时：

class Solution {
public:
    int trap(vector<int>& height) {
        int sum = 0;
        for (int i = 0; i < height.size(); i++) {
            if (i == 0 || i == height.size() - 1) continue;
            int rHeight = height[i];
            int lHeight = height[i];            
            for (int r = i + 1; r < height.size(); r++) {
                if (height[r] > rHeight) rHeight = height[r];
            }
            for (int l = i - 1; l >= 0; l--) {
                if (height[l] > lHeight) lHeight = height[l];
            }
            int h = min(lHeight, rHeight) - height[i];
            if (h > 0) sum += h;
        }
    	return sum;  
    }
};

动态规划：

class Solution {
public:
    int trap(vector<int>& height) {
        int sum = 0;
        vector<int> maxLeft(height.size());
        vector<int> maxRight(height.size());
        maxLeft[0] = height[0];
        maxRight[height.size() - 1] = height[height.size() - 1];
        for (int i = 1; i < height.size(); i++) {
            maxLeft[i] = max(height[i], maxLeft[i - 1]);
        }
        for (int j = height.size() - 2; j >= 1; j--) {
            maxRight[j] = max(height[j], maxRight[j + 1]);
        }
        int h;
        for (int i = 0; i < height.size(); i++) {
            h = min(maxLeft[i], maxRight[i]) - height[i];
            if (h > 0) sum += h;
        }
        return sum;  
    }
};

vector的初始化和使用

单调栈：

class Solution {
public:
    int trap(vector<int>& height) {
        int sum = 0;
        stack<int> st;
        st.push(0);
        for (int i = 1; i < height.size(); i++) {
            if (height[i] < height[st.top()]) st.push(i);
            else if (height[i] == height[st.top()]) {
                st.pop();
                st.push(i);
            }
            else {
                while (!st.empty() && height[i] > height[st.top()]) {
                    int mid = st.top();
                    st.pop();
                    if (!st.empty()) {
                        int h = min(height[st.top()], height[i]) - height[mid];
                        int l = i - st.top() - 1;
                        sum += h * l;
                        
                    }
                }
                st.push(i);
            }
        }
        return sum;  
    }
};