zoukankan      html  css  js  c++  java
  • LeetCode: Best Time to Buy and Sell Stock 解题报告

    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.

    Solution 1:

    min记录最小买入价

    maxProfit记录最大利润

    遍历array,不断更新最小买入价,计算更新最大利润

     1 public class Solution {
     2     public int maxProfit(int[] prices) {
     3         if (prices == null) {
     4             return 0;
     5         }
     6         
     7         int maxProfit = 0;
     8         int minValue = Integer.MAX_VALUE;
     9         
    10         for (int i: prices) {
    11             minValue = Math.min(minValue, i);
    12             maxProfit = Math.max(maxProfit, i - minValue);
    13         }
    14         
    15         return maxProfit;
    16     }
    17 }
    View Code

    GitHub代码链接

  • 相关阅读:
    【排序】题解_P1093奖学金
    简单了解连接服务器的要求
    centos7安装(纯文字版)
    JAVA虚拟机
    集合
    IO流
    反射
    多线程
    JAVA基础
    博客园皮肤文档
  • 原文地址:https://www.cnblogs.com/yuzhangcmu/p/4199812.html
Copyright © 2011-2022 走看看