Leetcode 121. Best Time to Buy and Sell Stock

class Solution {
    public int maxProfit(int[] prices) {
        int minimal = Integer.MAX_VALUE;
        int result = 0;
        for (int i = 0; i < prices.length; i++) {
            if (prices[i] < minimal) {
                minimal = prices[i];
                continue;
            }
            result = Math.max(prices[i] - minimal, result);
        }
        return result;
    }
}