菜单 学习猿地 - LMONKEY

VIP

开通学习猿地VIP

尊享10项VIP特权 持续新增

知识通关挑战

打卡带练!告别无效练习

接私单赚外块

VIP优先接,累计金额超百万

学习猿地私房课免费学

大厂实战课仅对VIP开放

你的一对一导师

每月可免费咨询大牛30次

领取更多软件工程师实用特权

入驻
71
0

[leetcode] Best Time to Buy and Sell Stock II

原创
05/13 14:22
阅读数 23209

标签:des   style   blog   class   code   java   

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

给定一个数组,第i个元素代表第i天的股票价格,现在可以进行无数次交易,但是在同一天中不能交易多次,求最大利润。

依次计算前后两天的差值作为利润,如果利润大于零,就加入到最大收益中,否则跳过。时间复杂度o(n)。

代码如下:

bubuko.com,布布扣
 1 class Solution {
 2 public:
 3     int maxProfit(vector<int> &prices) {
 4         // Start typing your C/C++ solution below
 5         // DO NOT write int main() function
 6         int result=0;
 7         if(prices.size()==0||prices.size()==1) return 0;
 8         for(int i=0;i<prices.size()-1;i++)
 9         {
10             int profit=prices[i+1]-prices[i];
11             if(profit>0)
12             {
13                 result+=profit;
14             }
15         }
16         return result;
17     }
18 };
bubuko.com,布布扣

 

[leetcode] Best Time to Buy and Sell Stock II,布布扣,bubuko.com

[leetcode] Best Time to Buy and Sell Stock II

发表评论

0/200
71 点赞
0 评论
收藏
为你推荐 换一批