D01- leetcode 121. Best Time to Buy and Sell Stock

121. Best Time to Buy and Sell Stock

You are given an array prices where prices[i] is the price of a give stock on the i th day.
You want to maximize your profit by choosing a single day to buy one stock and chooosing a different day in the future to sell that stock.
Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
在这里插入图片描述
Iterate over all the possible prices you will buy at and all the possible prices you will sell at, with the profit being the sell price minus the buy price. Get the maximum difference.

Class Solution{
	Public int maxProfit(int[] prices){
		//define the a variable for max profit
		int maxProfit = 0;
		//iterating all the possible buying prices
		// buying price starts from price[0]
		for(int i = 0; i < prices.length; i++){
			//iterating all the possible selling prices
			// selling price starts from price[i+1]
			for(int j = i + 1; j < prices.length - 1; j++){
				// computing the profits
				int profit = prices[j] - prices[i];
				if(profit > maxProfit){
					maxProfit = profit;
				}
			}
		}
		return maxProfit;
	}
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值