121:best time to Buy and Sell Stock "array" "two pointers"

Source: Internet
Author: User

Title Link: click~

/* Test instructions: An array, the element I represents the price of the stock of day I, only allowed to buy and sell once, for maximum profit *//** * Ideas: Two pointers, one scan the entire array, the other record the minimum value of the scanned element * During      the scan, update the minimum value while updating the maximum profit *      Maximum profit: Max (A[j]-a[i]), J>i */class Solution {public:    int maxprofit (vector<int> &prices) {        int len = Prices.size ();        if (Len <= 1) return 0;        int minn = prices[0];  First pointer: Record the minimum value        int profit = 0;    Maximum profit        for (int i = 1; i < Len; i + +) {   //second pointer, scan entire array            minn = MIN (minn, prices[i]);            Profit = Max (Profit, Prices[i]-Minn);        }        return profit;}    ;


121:best time to Buy and Sell Stock "array" "two pointers"

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.