收集雨水问题

 1 #include <iostream>
 2 using namespace std;
 3 
 4 int TrappingRainWater(int A[],int n){
 5     int SecHight = 0;//当前找到的第二大数
 6     int left = 0;
 7     int right = n-1;
 8     int trap = 0;//依次遍历每个方柱能装水的容量
 9     while(left<right){
10         if(A[left]<A[right]){
11             SecHight = max(SecHight,A[left]);
12             trap += (SecHight-A[left]);
13             left++;
14         }
15         else{
16             SecHight = max(SecHight,A[right]);
17             trap +=(SecHight-A[right]);
18             right--;
19         }
20     }
21     return trap;
22 }
23 int main()
24 {
25     int A[] ={0,1,0,2,1,0,1,3,2,1,2,1};
26     cout<<TrappingRainWater(A,sizeof(A)/sizeof(int))<<endl;
27     return 0;
28 }