121|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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

买一个股票and 买一个股票,设计一个算法找到最大的利润
Note that you cannot sell a stock before you buy one.

Example 1:
Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 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
Explanation: In this case, no transaction is done, i.e. max profit = 0.

class Solution {
    public int maxProfit(int[] prices) {
          
          int max_profit=0;
          int min_value=Integer.MAX_VALUE;

          int profit=0;
          for(int i=0;i<prices.length;i++){
              if(prices[i]<min_value){
                  min_value=prices[i];
              }else if(prices[i]-min_value>max_profit){
                  max_profit=prices[i]-min_value;
              }
          }
          return max_profit;
    }
}

在这里插入图片描述

©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页