LeetCode-best time to buy and sell stock 1 数组

1.问题

Say you have an array for which the i th 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.

分析：假设你有一个数组，其中第i个元素是一个给定股票第i天的价格。只能进行一次交易，寻找最大利润。

找到数组中最小的元素与最大的元素，最大值要在最小值之前。

设两个变量，一个存储当前找到的最小值，一个存储当前最大的利润差值，遍历数组。

2、解答

public class Solution {public int maxProfit(int[] prices) {int maxout = 0;int min = Integer.MAX_VALUE;for(int i = 0; i<prices.length;i++){if(prices[i]<min)min = prices[i];if(prices[i]-min >maxout)maxout = prices[i] - min;}return maxout;}
}

LeetCode-best time to buy and sell stock 1 数组相关推荐

leetcode: Best Time to Buy and Sell Stock 系列
leetcode: Best Time to Buy and Sell Stock 系列一系列包括: - Best Time to Buy and Sell Stock Ⅰ - Best Time ...
Leetcode Best Time to Buy and Sell Stock III
Leetcode Best Time to Buy and Sell Stock III,本算法的关键为找出其动态子结构.可以发现,序列中的最小值可以做为其的一个分割,令左边序列为left,右边的序列 ...
Leetcode Best Time to Buy and Sell Stock
Leetcode Best Time to Buy and Sell Stock 相关代码,本题使用dp算法完成,本算应该算得上一个经典的dp算法题. #include <iostream> ...
LeetCode Best Time to Buy and Sell Stock II
原题链接在这里:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ 题目: Say you have an array ...
[LeetCode] 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 ...
[leetcode]_Best Time to Buy and Sell Stock I II
一个系列三道题,我都不会做,google之答案.过了两道,第三道看不懂,放置,稍后继续. 一.Best Time to Buy and Sell Stock I 题目:一个数组表示一支股票的价格变换. ...
LeetCode Best Time to Buy and Sell Stock(dp)
Say you have an array for which the ith element is the price of a given stock on day i. If you were ...
LeetCode Best Time to Buy and Sell Stock with Cooldown(动态规划)
问题:给定一个整数数组,其中第i个元素表示第i天的股票价格.可以多次买卖股票,卖出股票后,无法在第二天买入股票. 思路:动态规划法,用dp(i,j)表示第i天持有或者不持有股票的最大利润.用dp(i, ...
[leetcode]Best Time to Buy and Sell Stock III
先说思路.参考了这篇:http://blog.unieagle.net/2012/12/05/leetcode%E9%A2%98%E7%9B%AE%EF%BC%9Abest-time-to-buy-a ...
Leetcode Best Time to Buy and Sell Stock IV(最大子段和)
朴素的O(n^2)过不了,这里借鉴前人的思想,总结一下. 主要利用栈维护对后面产生影响的字段,然后利用贪心的思想逐步合并. 首先,找到每一对最低点(vx),最高点(px); 其次,合并当前(vx, p ...

LeetCode-best time to buy and sell stock 1 数组

LeetCode-best time to buy and sell stock 1 数组相关推荐

最新文章

热门文章