leetcode:121. Best Time to Buy and Sell Stock(Java)解答
Posted boy_nihao
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode:121. Best Time to Buy and Sell Stock(Java)解答相关的知识,希望对你有一定的参考价值。
转载请注明出处:z_zhaojun的博客
原文地址
题目地址
Best Time to Buy and Sell Stock My Submissions Question
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.
解法(java):数组中第i个数字减去前面i-1个数字中的最小数字即为从前i个股票价格变化中可得到的最大收益。
public int maxProfit(int[] prices)
int maxPro = 0;
int minPrice = Integer.MAX_VALUE;
for (int price : prices)
maxPro = Math.max(maxPro, price - minPrice);
minPrice = Math.min(minPrice, price);
return maxPro;
以上是关于leetcode:121. Best Time to Buy and Sell Stock(Java)解答的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode OJ 121. Best Time to Buy and Sell Stock
Leetcode 121 Best Time to Buy and Sell Stock
LeetCode 121: Best Time to Buy and Sell Stock
LeetCode 121 Best Time to Buy and Sell Stock