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

Example 1:

Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)

Example 2:

Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.


其实就是求前后两个数最大的差值,当然前提是前面的数更小。

我们可以遍历一次这个数组,在遍历的过程中记录下当前的最小值,并且计算出在当前点可以获得的最大值  整个算法的复杂度O(N)

public class Solution {
    public int maxProfit(int[] prices) 
    {
        int n=prices.length;
        int s=0;
        if(n==0)
            return 0;
        int minNum=prices[0];
        for(int i=1;i<n;i++)
        {
            if(prices[i]<minNum)
                minNum=prices[i];
            else if(prices[i]-minNum>s)
                s=prices[i]-minNum;
        }
        return s;
    }
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值