LeetCode 121 Best Time to Buy and Stock

Source: Internet
Author: User

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 every one share of the stock), design an algorithm to find the maximum profit.

Use an array A [n-1] to store the stock price difference between the current day and the previous day, and convert the question into the maximum subsequence and the problem, except that there is no negative value, and the minimum value is 0. A [I] indicates the difference between the stock price on the I + 1 day and the stock price on the I day.

Public class Solution {public int maxsum (int [] num) {int sum = 0; int max = 0; for (int I = 0; I <num. length; I ++) {sum + = num [I]; if (sum <0) sum = 0; if (max <sum) max = sum;} return max ;} public int maxProfit (int [] prices) {if (prices. length = 0 | prices. length = 1) return 0; int [] sub = new int [prices. length-1]; for (int I = 0; I <sub. length; I ++) {sub [I] = prices [I + 1]-prices [I];} return maxsum (sub );}}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.