Best Time to Buy and Sell Stock ( Leetcode)

At first, I used 2 for loops, but in aspects of time space, it was not efficient.

I thought about several ways, then, chose to use dynamic programming.( Need to study more about dp)

 

This is what I solved the problem.

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