LeetCode: Best Time to Buy and Stock

Source: Internet
Author: User

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

Idea: traverse the array and save the minimum low of the elements that have already been traversed. Then, the maximum benefit of selling a stock on the day I is prices [I]-low, and you can find the maximum benefit of the day.


Int maxProfit (vector

& Prices) {int length = prices. size (); if (length = 0) return 0; int max_profit = 0; int low = prices [0]; for (int I = 1; I <length; I ++) {int temp = prices [I]-low; if (temp> max_profit) max_profit = temp; if (prices [I] <low) low = prices [I];} return max_profit ;}


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.