zoukankan      html  css  js  c++  java
  • LeetCode——Best Time to Buy and Sell Stock

    Description:

    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.

    只允许买卖一次,求最大利润。

    动态规划,从后向前找最大股价,减去当前股价,求利润,找最大利润。O(n).

    public class Solution {
        public int maxProfit(int[] prices) {
            
            int len = prices.length;
            if(len == 0) return 0;
            int highestPrice = prices[len - 1];
            int res = 0;
            for(int i=len-1; i>=0; i--) {
                highestPrice = max(highestPrice, prices[i]);
                res = max(res, highestPrice-prices[i]);
            }
            
            return res;
        }
        
        int max(int a, int b) {
            return a > b ? a : b;
        }
    }
  • 相关阅读:
    Linux系统配置静态ip
    爬虫之如何找js入口(一)
    asyncio动态添加任务
    关于python导包问题
    python动态添加属性
    requests模块
    反selenium关键字
    PIL模块
    openxlsx模块
    CSV
  • 原文地址:https://www.cnblogs.com/wxisme/p/4859834.html
Copyright © 2011-2022 走看看