Basics

• subarray 问题 想到 prefix sum

Problems

best time buy and sell stock: http://www.lintcode.com/en/problem/best-time-to-buy-and-sell-stock/

best time buy and sell stock ii: http://www.lintcode.com/en/problem/best-time-to-buy-and-sell-stock-ii/

best time buy and sell stock iii: http://www.lintcode.com/en/problem/best-time-to-buy-and-sell-stock-iii/

maximum subarray: http://www.lintcode.com/en/problem/maximum-subarray/

maximum subarray ii: http://www.lintcode.com/en/problem/maximum-subarray-ii/

maximum subarray iii: http://www.lintcode.com/en/problem/maximum-subarray-iii/

minimum subarray: http://www.lintcode.com/en/problem/minimum-subarray/

maximum subarray difference: http://www.lintcode.com/en/problem/maximum-subarray-difference/

subarray sum: http://www.lintcode.com/en/problem/subarray-sum/

subarray sum closest: http://www.lintcode.com/en/problem/subarray-sum-closest/

Minimum Size Subarray Sum: https://leetcode.com/problems/minimum-size-subarray-sum/description/