Best Time to Buy and Sell Stock

最新推荐文章于 2017-10-16 09:54:46 发布

K.Sun

最新推荐文章于 2017-10-16 09:54:46 发布

阅读量686

点赞数

分类专栏： Algorithm

本文链接：https://blog.csdn.net/sinat_36246371/article/details/53893772

版权

Algorithm 专栏收录该内容

139 篇文章 1 订阅

订阅专栏

原文地址：https://leetcode.com/problems/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.

题目的可以抽象一句话：求一个数组中后面一个元素减去前面一个元素得到的差的最大值，如果这个差小于0，那么返回0，其他的就返回其本身。

一个数组：

A=[a1,a2,a3,......,an−1,an] $A=[a_1,a_2,a_3,......,a_{n-1},a_n]$

其中存在这么两个元素 $a_i$ 和 $a_j$ ，其中 $0\le i<j\le n$ ，并且有： $a_j-a_i$ 比数组中任意两个元素 $a_k-a_l$ 的差都大，其中 $0\le j<k\le n$ 的差都大。于是根据数组A我们可以得到数组B：

B=[a2−a1,a3−a2,a4−a3,......,an−an−1,an] $B=[a_2-a_1,a_3-a_2,a_4-a_3,......,a_n-a_{n-1},a_n]$

我们可以看到数组B的任意连续子数组的和就是 $a_j-a_i$ ，现在求得是 $a_j-a_i$ 的最大值，也就是说求数组B中连续子数组的和的最大值，这个就变成了很经典的问题了，代码实现如下：

public class BestTimeToBuyAndSellStock {
    public static int maxProfit(int[] prices) {
        if (prices.length == 0)
            return 0;
        if (prices.length == 1)
            return 0;

        int[] np = new int[prices.length - 1];

        for (int i = 0; i < prices.length - 1; i++) {
            np[i] = prices[i + 1] - prices[i];
        }

        int maxProfit = maxSubArraySum(np);


        return maxProfit > 0 ? maxProfit : 0;
    }

    public static int maxSubArraySum(int a[]) {
        int size = a.length;
        int max_so_far = 0, max_ending_here = 0;

        for (int i = 0; i < size; i++) {
            max_ending_here = max_ending_here + a[i];
            if (max_ending_here < 0)
                max_ending_here = 0;
            if (max_so_far < max_ending_here)
                max_so_far = max_ending_here;
        }
        return max_so_far;
    }

    public static void main(String[] args) {
        int[] prices = {7, 6, 4, 3, 1};
        System.out.println(maxProfit(prices));
    }
}