Two Pointer Trapping Rain Water Question: http://www.lintcode.com/en/problem/trapping-rain-water/ Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. Example Given [0,1,0,2,1,0,1,
Forward-Backward Traversal, Maximum Subarray II Question: Given an array of integers, find two non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguous. Return the largest sum. Notice The subarray should contain at least one number Answer: class Solution { public: /* * @param nums: A list