LeetCode 121. Best Time to Buy and Sell Stock

欢迎访问原文所在博客：https://52heartz.top/articles/leetcode-121-best-time-to-buy-and-sell-stock/

解答1[Java]：

public class Solution {
    public int maxProfit(int prices[]) {
        int minprice = Integer.MAX_VALUE;
        int maxprofit = 0;
        for (int i = 0; i < prices.length; i++) {
            if (prices[i] < minprice)
                minprice = prices[i];
            else if (prices[i] - minprice > maxprofit)
                maxprofit = prices[i] - minprice;
        }
        return maxprofit;
    }
}

思路

涉及两个变量，一个存储截至目前最小的值，一个存储截至目前最大的利润。