zoukankan      html  css  js  c++  java
  • 121. Best Time to Buy and Sell Stock

    #week8

    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.

    分析:

    动态规划

    每个地方的最大profit为本身减去前面最小的(当前面最小的>=本身时为0)

    状态转换方程:

    low[i] = (low[i-1] < prices[i])? low[i-1]:prices[i];
    f[i] = (low[i-1] < prices[i])? (prices[i]-low[i-1]):0;

    初始化:

    f[0] = 0;
    low[0] = prices[0];

    题解:

     1 class Solution {
     2 public:
     3     int maxProfit(vector<int>& prices) {
     4         int size = prices.size();
     5         if (size == 0) return 0;
     6         int f[size], low[size], max = 0;
     7         f[0] = 0;
     8         low[0] = prices[0];
     9         for (int i = 1; i < size; i++) {
    10             low[i] = (low[i-1] < prices[i])? low[i-1]:prices[i];
    11             f[i] = (low[i-1] < prices[i])? (prices[i]-low[i-1]):0;
    12             if (f[i] > max) max = f[i];
    13         }
    14         return max;
    15     }
    16 };
  • 相关阅读:
    提升PHP执行效率的一些小细节
    linux文件处理命令
    C# file操作
    C# MD5
    C# guid
    C# Path类 Directory类
    MarkDown学习
    从GitHub建站迁移到服务器(Java环境)
    sonarqube在windows上软件安装,配置及使用
    【优化】记录一次方法性能优化
  • 原文地址:https://www.cnblogs.com/iamxiaoyubei/p/8278248.html
Copyright © 2011-2022 走看看