121. Best Time to Buy and Sell Stock (Array)

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.

思路:注意不能简单地将最大值-最小值。卖必须发生在买之后,最小值得在最大值之前。

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        if(prices.empty()) return 0;
        int maxProfit = 0;
        int min = INT_MAX;
        int profit;

        for(vector<int>::iterator it = prices.begin(); it < prices.end(); it ++)
        {
             if ((*it)<min)
             {
                 min = *it;
             }
             else
             {
                profit = *it - min;
                if(profit > maxProfit)
                {
                    maxProfit = profit;
                }
             }
        }
        return maxProfit;
    }
};
时间: 2024-10-29 10:46:16

121. Best Time to Buy and Sell Stock (Array)的相关文章

121. Best Time to Buy and Sell Stock (一) leetcode解题笔记

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 (ie, buy one and sell one share of the stock), design an algor

leetCode 121. Best Time to Buy and Sell Stock 数组

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 (ie, buy one and sell one share of the stock), design an algor

[email&#160;protected] [121]Best Time to Buy and Sell Stock

Best Time to Buy and Sell Stock Total Accepted: 69292 Total Submissions: 206193 Difficulty: Medium 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

【leetcode】121. Best Time to Buy and Sell Stock

@requires_authorization @author johnsondu @create_time 2015.7.19 21:01 @url [best time to buy and sell stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) /************************ * @description: dynamic programming. * 相邻元素做差,然后转化

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 (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit. Exam

LeetCode 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 (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit

Leetcode 121. Best Time to Buy and Sell Stock JAVA语言

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. Exam

(Array)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 (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit. publ

LeetCode OJ 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 (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit. [思路]