Easy-34
来源:互联网 发布:摄影师证书含金量知乎 编辑:程序博客网 时间:2024/06/05 17:11
leetcode 122. Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on dayi.
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).
AC:
int maxProfit(int* prices, int pricesSize) {
int start=-1,end=-1,result=0;
if(pricesSize<=1)
{
return 0;
}
for(int i=0;i<pricesSize-1;i++)
{
if(prices[i+1]>=prices[i]&&start<0)
{
start=i;
}
if(start>=0&&prices[i+1]>=prices[i])
{
end=i+1;
}
if((start>=0&&end>=0&&prices[i+1]<prices[i])||(start>=0&&end==pricesSize-1))
{
result+=prices[end]-prices[start];
i=end;
start=-1;end=-1;
}
}
return result;
}
tips:抱着不过的心,居然过了。。。单次循环,设置买入点和卖出点,然后计算利润的条件。找到第一个后一天大于今天的价格,设置为买入, 当后一天的价格大于前一天则继续持有股票,否则卖出。并设置买入点从卖出点的后一天开始。 一直持有股票,当卖出点为天数的最大值时,也卖出。
- Easy-34
- easy
- Easy
- Easy-题目34:119. Pascal's Triangle II
- Easy Plugs
- easy problem
- So Easy!
- so easy
- easy explorer
- Easy Explore
- Easy Task
- Easy Task
- Easy CHM
- HDU2699+Easy
- HDU4648+Easy
- Easy billiards
- Easy STL
- easy connect
- java基础编程笔记3
- 端口号被占用
- 线程总结
- 解决HttpURLConnection setConnectTimeout超时无响应的问题
- 用java实现从txt文本文件批量导入数据至数据库
- Easy-34
- centos 7下启动mysql失败问题及 解决
- Android自定义view绘制圆环占比动画
- 我学到的CMMI
- 堆排序
- 给dubbo接口添加白名单——dubbo Filter的使用
- android:layout_weight的真实含义
- Java中Synchronized的用法
- Maven详解