LintCode 149: Best Time to Buy and Sell Stock

**149. Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Example
Given array [3,2,3,1,2], return 1.

Solution:
Keep the minimum so far, then calculate the gap between current value with the minimum. The maximum gap is the result.**

代码如下：
保存到当前为止的最小值，并维持当前元素与最小值的差。该差值的最大值即为所求。不知道这个方法是不是就是所谓的扫描线法?

class Solution {
public:
    /**
     * @param prices: Given an integer array
     * @return: Maximum profit
     */
    int maxProfit(vector<int> &prices) {
        
        int len = prices.size();
        int minV = INT_MAX;
        int result = 0;
        for (int i = 0; i < len; ++i) {
            if (prices[i] < minV) {
                minV = prices[i];
            }
            
            if ((prices[i] - minV) > result) {
                result = prices[i] - minV;
            }
        }
        
        return result;
    }
};