Java for Leetcode 121 best time to Buy and Sell Stock

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