Easy Java Solution beats 100%
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->O(n)

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->O(1)

# Code
```java []
class Solution {
    public int maximumDifference(int[] nums) {
        int a =Integer.MAX_VALUE;  // a variable to track current. same question as buy and sell stock
        int maxDiff=-1;

        for(int i=0;i<nums.length;i++){
        if(a<nums[i]){
            int diff = nums[i]-a;
            maxDiff= Math.max(diff,maxDiff);
        }
        else{
            a=nums[i];
        }
        }
        return maxDiff;
           
        
    }
}
```
['Java']