LeetCode: Best Time to Buy and Sell Stock II

Approach 1: O(n), find the lowest then find next highest, then lowest,
then highest, …