zoukankan      html  css  js  c++  java
  • 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.

    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.

    //Time: O(n), Space: O(1)  
      public int maxProfit(int[] prices) {
            if (prices == null || prices.length == 0) {
                return 0;
            }
            
            int profit = 0;
            int min = prices[0];
            
            for (int i = 0; i < prices.length; i++) {
                min = Math.min(min, prices[i]);
                profit = Math.max(profit, prices[i] - min);
            }
            
            return profit;
        }
  • 相关阅读:
    手把手教你用Python制作简易小说阅读器
    JSP的page指令
    Web应用的目录结构
    myeclipse怎么集成tomcat
    Tomcat启动注意点
    JSP基础概念
    SQL数据库数据类型详解
    注释和特殊符号
    StringBuffer
    String
  • 原文地址:https://www.cnblogs.com/jessie2009/p/9774529.html
Copyright © 2011-2022 走看看