JAVA | | ThinkSimple (100% Efficiency)--;
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int maximumDifference(int[] nums) {\n        int max=0,min=nums[0];\n        for(int i=1;i<nums.length;i++){\n             if(nums[i]>min){\n                 int d=nums[i]-min;\n                 max=Math.max(d,max);\n             }\n             min=Math.min(min,nums[i]);\n        }\n        if(max>0)\n        return max;\n        return -1;\n    }\n}\n```
['Java']