JuniorArray
Maximum Difference Between Increasing Elements
Given a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (that is, nums[j] - nums[i]), such that 0 <= i < j < n and nums[i] < nums[j].
Return the maximum difference. If no such i and j exists, return -1.
Example 1
Input
nums = [7,1,5,4]Output
4The maximum difference occurs with
i = 1 and j = 2, where nums[j] - nums[i] = 5 - 1 = 4; using i = 1 and j = 0 is invalid because i > j.Example 2
Input
nums = [9,4,3,2]Output
-1There is no
i and j such that i < j and nums[i] < nums[j].Constraints
- n == nums.length
- 2 <= n <= 1000
- 1 <= nums[i] <= 10^9