z_zhaojun的博客

机会只会留给有准备的人

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;
    }
阅读更多
版权声明:本文为博主原创文章,转载请注明出处。博客首页:http://blog.csdn.net/u012975705。订阅:http://blog.csdn.net/u012975705/rss/list https://blog.csdn.net/u012975705/article/details/50809760
个人分类: LeetCode
上一篇leetcode:238. Product of Array Except Self(Java)解答
下一篇leetcode:122. Best Time to Buy and Sell Stock II(java)解答
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭