Leetcode121. 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 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
Example 2:
Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.
思路
题目大意：数组中的元素是那天股票抛出的价格，写出一个函数来找到出手时最大的利润。
解题思路：先求出最小的抛出价格，然后再遍历寻找最大的差值
代码

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length==0) return 0;
        int minprices=prices[0];
        int maxprofit=0;
        //寻找最小的元素，然后寻找与最小元素差值最大的差
        for(int i=0;i<prices.length;i++){
            minprices=minprices<prices[i]?minprices:prices[i];
            if(maxprofit<prices[i]-minprices)
           maxprofit=prices[i]-minprices;
        }
      return maxprofit;  
    }
}

原题地址这里写链接内容