LeetCode689. Maximum Sum of 3 Non-Overlapping Subarrays
Solution1:DivideandConquerThisquestionasksforthethreenon-overlappingintervalswithmaximumsum.Sothiscanbedividedinto3parts--find3non-overlappingintervalsrespectively,andcombiningtheresultstogetthe3non-o