LeetCode: Best Time to Buy and Sell Stock

一次过

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (prices.size() <= 1) return 0;
        int minprice = prices[0];
        int maxprofit = 0;
        for (int i = 1; i < prices.size(); i++) {
            minprice = min(minprice, prices[i]);
            maxprofit = max(maxprofit, prices[i]-minprice);
        }
        return maxprofit;
    }
};

 Java

public class Solution {
    public int maxProfit(int[] prices) {
        int ans = 0;
        if (prices.length < 2) return ans;
        int minPrice = prices[0];
        for (int i = 1; i < prices.length; i++)
        {
            ans = Math.max(ans, prices[i] - minPrice);
            minPrice = Math.min(minPrice, prices[i]);
        }
        return ans;
    }
}