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

    思路:

    遍历数组,找当前最小值curMin,结果max一定是当前最小值之后一个数和它的差。

    遍历过程中不断更新curMin和max。

    复杂度O(N);

    本题代码:

    import java.util.Scanner;
    
    /**
     * Created by yuanxu on 17/4/12.
     */
    public class DP121 {
    
        public static int maxProfit(int[] prices) {
            if (prices.length == 0) {
                return 0;
            }
            int max = 0;
            int curMin = prices[0];
            for (int i=1; i<prices.length; i++) {
                if (prices[i] > curMin) {
                    max = (prices[i] - curMin) > max ? (prices[i] - curMin) : max;
                } else {
                    curMin = prices[i];
                }
            }
            return max;
        }
    
    
        public  static void main(String args[]) {
            Scanner scanner = new Scanner(System.in);
            String inputString = scanner.nextLine();
            String stringArray[] = inputString.substring(1,inputString.length()-1).split(", ");
            int prices[] = new int[stringArray.length];
            for(int i=0; i<stringArray.length; i++) {
                prices[i] = Integer.parseInt(stringArray[i]);
            }
            System.out.println(maxProfit(prices));
        }
    
    
    
    }
  • 相关阅读:
    记我安装Caffe的血泪史(1)
    UWP连接mysql 实现数据远程备份
    数据库性能测试
    性能瓶颈分析定位
    系统安全性测试
    WEB安全性测试点
    jmeter测试报告分析
    Linux常用命令大全
    软件测试入门到飞升上仙之客户端
    软件测试入门到飞升上仙之web 端测试
  • 原文地址:https://www.cnblogs.com/pinganzi/p/6701949.html
Copyright © 2011-2022 走看看