121-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 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.

思路：

1.目标是求数组中的某两个值的差（最大差值），前提是大的数在小的数后面

2.循环遍历数组，设置一个当前最小值min(初始为Integer.MAX_VALUE)和一个最大差值max(初始化为0)

每次更新min,并更新max(当前元素值-min)

public class Solution {public int maxProfit(int[] prices) {int len=prices.length;     //数组长度int max=0;                    //最大差值int min=Integer.MAX_VALUE;              //当前最小值for(int i=0;i<len;i++) {if(prices[i]<min)min=prices[i];if(prices[i]-min>max)max=prices[i]-min;}return max;}
}

转载于:https://www.cnblogs.com/hwu2014/p/4422009.html

121-Best Time to Buy and Sell Stock相关推荐

【贪心和 DP + 卖股票】LeetCode 121. Best Time to Buy and Sell Stock
LeetCode 121. Best Time to Buy and Sell Stock Solution1:我的答案动态规划和贪心不要区分的那么明显嘛~~~ class Solution { p ...
LeetCode 121 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 121. 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 w ...
leetcode python3 简单题121. Best Time to Buy and Sell Stock
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百二十一题 (1)题目英文: Say you have an array fo ...
Leetcode——121. Best Time to Buy and Sell Stock
题目原址 https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/ 题目描述 Say you have an ...
LeetCode 121 Best Time to Buy and Sell Stock（股票买入卖出的最佳时间）
翻译话说你有一个数组,其中第i个元素表示在第i天的股票价格.如果你被只被允许最多一次交易(例如,买入然后卖出一个股票),设计一个算法并找出最大利润. 原文 Say you have an array ...
leetcode 121.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 w ...
121. Best Time to Buy and Sell Stock买卖股票的最佳时机
You are given an array prices where prices[i] is the price of a given stock on the ith day. 给定一个数组 p ...
121 Best Time to Buy and Sell Stock
输入:一个数组prices,prices[i]表示第i天股票的价格. 输出:买卖股票的最大收益. 规则:只允许最多买一次,最多卖一次股票.如果觉得价格不合适,可以不买卖. 分析1:最先想到的是暴力搜索 ...
121. Best Time to Buy and Sell Stock
一.题目 1.审题 2.分析给出一个数组,让你先已 val1 买入,再以 val2 卖出,求获得的利润最大是多少. 二.解答 1.思路: 方法一. 用遍历 min 记录到当前位置的最小值: max ...

121-Best Time to Buy and Sell Stock

121-Best Time to Buy and Sell Stock相关推荐

最新文章

热门文章