leetcode Trapping Rain Water

无脑写代码代码（TLE）：

#include<iostream>
#include<vector>

using namespace std;

int findLeft(int i, vector<int> height)
{
    int t = i-1;
    while ((t+1<height.size())&&t >= 0)
    {
        if (height[t] > height[t + 1])
            t--;
        else
            break;
    }
    return t + 1;
}

int findRight(int i, vector<int> height)
{
    int t = i + 1; 
    while ((t-1>=0)&&t < height.size())
    {
        if (height[t] > height[t - 1])
            t++;
        else
            break;
    }
    return t - 1;
}

int trap(vector<int>& height) 
{
    int L = height.size();
    int sum = 0;
    for (int i = 1; i < L-1; i++)
    {
        int left = findLeft(i, height);
        int right = findRight(i, height);
        if (left < i&&right > i)
        {
            int high = height[left] < height[right] ? height[left] : height[right];
            for (int j = left+1; j < right; j++)
            {
                sum = sum + high - height[j];
            }
        }
    }
    return sum;
}

int main()
{
    vector<int> height = { 0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1 };
    cout << trap(height) << endl;
}