gavinashg@yahoo.com
BAN USERStep 1: Start from first integer and assign two pointers(left , right) to it. Increment right pointer and add the integer if the area of rectangle increases.
Step 2: Stop when the area of rectangle decreases. Compare the current area with the maxArea. Let maxArea be the max of the two.
Step 3: Now increment the left pointer as long as area increases. If area if greater than maxArea, update maxArea.
Step 4: Increment right pointer as long as the area decreaes. This to remove the low points in the graph. Stop when the area starts increasing.
Step 4: Now assign left = right and continue above algorithm
Because when a derived destructor is called, all the base destructors should also be called.
- gavinashg@yahoo.com September 20, 2011
RepAre you looking a solution for marry your love? Islamic dua to marry someone you love is the effective solution ...
RepStonefire Arms manufacture and bring Firearms parts & accessories to the market at reasonable prices. We offer a wide variety of ...
RepDeveloped several new methods for licensing g.i. joes in Los Angeles, CA. Spent high school summers creating marketing channels ...
Repmaccydonal4747, Data Engineer at A9
Hi my sweet companions! My name is Maccy Donal, I conceived in Canada Toronto 1994 and I am unceasingly appreciative ...
Ishant your solution does not work.
- gavinashg@yahoo.com September 25, 2011Consider a,b,c,d
Your solution considers only a,b,c,d,a+b,a+b+c,a+b+c+d,b+c,b+c+d,c+d.
It does not consider a+c.