Java for Leetcode 121 best time to Buy and Sell Stock

Source: Internet
Author: User

Say you has an array for which the i-th element is the price of a given-stock on day I.

If you were-permitted-to-complete at most one transaction (ie, buy one and sell one share of the stock), design an AL Gorithm to find the maximum profit.

Problem Solving Ideas:

One traversal, each time a minimum buy point is found, the Java implementation is as follows:

    public int Maxprofit (int[] prices) {        int buy = 0;        int profit = 0;        for (int i = 0; i < prices.length; ++i) {            if (Prices[buy] > prices[i])                buy = i;            Profit = Math.max (Profit, Prices[i]-prices[buy]);        }        return profit;    }

Java for Leetcode 121 best time to Buy and Sell Stock

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.