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

    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.
    题意:给定一串股票价格,问之买卖一次收益最多
    代码如下:
    /**
     * @param {number[]} prices
     * @return {number}
     */
    var maxProfit = function(prices) {
        let len=prices.length
        let max=0
        for(let i=0;i<len;i++){
            for(let j=i+1;j<len;j++){
    //         股票价格高于前面的
                if(prices[i]<prices[j]){
                    max=prices[j]-prices[i]>max?prices[j]-prices[i]:max
                }
            }
        }
        return max
    };
  • 相关阅读:
    等待通知--wait notify
    表单重复提交与解决
    Cookie Session 与Token
    springMVC实现登陆
    第11章 AOF持久化
    第10章 RDB持久化
    MyBatis动态SQL
    第4章 网络层
    第9章 数据库
    代理设计模式
  • 原文地址:https://www.cnblogs.com/xingguozhiming/p/10858910.html
Copyright © 2011-2022 走看看