leetcode:Best Time to Buy and Sell Stock II 【Java】
来源:互联网 发布:冒泡排序法c语言讲解 编辑:程序博客网 时间:2024/06/15 14:42
一、问题描述
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).
二、问题分析
只要后一天股价比前一天高就卖出。
三、算法代码
public class Solution { public int maxProfit(int[] prices) { int profit = 0; int diff = 0; for(int i = 1; i <= prices.length - 1; i++){ diff = prices[i] - prices[i - 1]; if(diff > 0){ profit += diff; } } return profit; }}
0 0
- [Leetcode] Best Time to Buy and Sell Stock II (Java)
- leetcode:Best Time to Buy and Sell Stock II 【Java】
- [LeetCode]Best Time to Buy and Sell Stock II
- LeetCode Best Time to Buy and Sell Stock II
- Leetcode: Best Time to Buy and Sell Stock II
- [Leetcode] Best Time to Buy and Sell Stock II
- LeetCode : Best Time to Buy and Sell Stock II
- LeetCode Best Time to Buy and Sell Stock II
- [LeetCode] Best Time to Buy and Sell Stock II
- leetcode 61: Best Time to Buy and Sell Stock II
- [LeetCode] Best time to buy and sell a stock II
- 【leetcode】Best Time to Buy and Sell Stock II
- LeetCode - Best Time to Buy and Sell Stock II
- LeetCode之Best Time to Buy and Sell Stock II
- [LeetCode]Best Time to Buy and Sell Stock II
- [Leetcode]Best Time to Buy and Sell Stock II
- [leetcode]Best Time to Buy and Sell Stock II
- [LeetCode] Best Time to Buy and Sell Stock II
- 怎么在mac终端上执行R脚本
- html5中链接和分组标签
- 分治法——归并排序
- Kiss you goodbye
- Prim算法
- leetcode:Best Time to Buy and Sell Stock II 【Java】
- C++面向对象高级编程笔记01--GeekBand
- mybatis脱离其他框架,利用main或者junit测试代码
- hihoCoder#1032 : 最长回文子串(manacher算法)
- kidd风的IOS日志之地图与定位
- SQL读书笔记(九) UNION
- jmp_buf的使用,结构定义为数组
- 工厂模式理解
- 自学 java 笔记 day9(继承下)