Given a list of profits, choose which day to lock in and return max profit possible

ie: [-1, 1] = 1 is best profit
ie: [1, 2, 3, 4] = 10 is best profit

needs to be done in one pass

O(N)
O(1)