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

    1.题目


    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.



    2.解决方式


    class Solution {
    public:
        int maxProfit(vector<int> &prices) {
            if(prices.size() == 0 || prices.size() == 1){
                return 0;
            }
            int profit = 0;
            int min = prices[0];
            for(int i = 1; i < prices.size(); i++){
                profit = (prices[i] - min) > profit ? (prices[i] - min) :  profit;
                min = prices[i] > min ? min : prices[i];
            }
            return profit;
        }
    };

    思路:记录最低点和最高利润,有变化就更新。


    www.waitingfy.com/archives/1640

  • 相关阅读:
    0325JavaScript
    0322css样式表,选择器
    0320表单
    0313函数
    0312数组
    0311类
    0309笔记整理
    进制转换
    Xcode快捷键大全
    Android LearningNotes
  • 原文地址:https://www.cnblogs.com/slgkaifa/p/6889761.html
Copyright © 2011-2022 走看看