Given a log of stock prices compute the maximum possible earning

MaxProfit.java

public class MaxProfit {
	public int solution(int[] A) {
		if(A == null || A.length < 2) {
			return 0;
		}
		
		int maxProfit = 0;
		int min = -1;
		
		for(int i = 0; i < A.length; i++) {
			if(min == -1 || min > A[i]) {
				min = A[i];
				continue;
			}
			
			maxProfit = Math.max(maxProfit, A[i] - min);
		}
		
		return maxProfit;
	}
}