Package g2001_2100.s2016_maximum_difference_between_increasing_elements

Class Solution

java.lang.Object

g2001_2100.s2016_maximum_difference_between_increasing_elements.Solution

public class Solution
extends Object

2016 - Maximum Difference Between Increasing Elements.<p>Easy</p> <p>Given a <strong>0-indexed</strong> integer array <code>nums</code> of size <code>n</code>, find the <strong>maximum difference</strong> between <code>nums[i]</code> and <code>nums[j]</code> (i.e., <code>nums[j] - nums[i]</code>), such that <code>0 <= i < j < n</code> and <code>nums[i] < nums[j]</code>.</p> <p>Return <em>the <strong>maximum difference</strong>.</em> If no such <code>i</code> and <code>j</code> exists, return <code>-1</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [7, <strong>1</strong> , <strong>5</strong> ,4]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong></p> <p>The maximum difference occurs with i = 1 and j = 2, nums[j] - nums[i] = 5 - 1 = 4.</p> <p>Note that with i = 1 and j = 0, the difference nums[j] - nums[i] = 7 - 1 = 6, but i > j, so it is not valid.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [9,4,3,2]</p> <p><strong>Output:</strong> -1</p> <p><strong>Explanation:</strong></p> <p>There is no i and j such that i < j and nums[i] < nums[j].</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [<strong>1</strong> ,5,2, <strong>10</strong> ]</p> <p><strong>Output:</strong> 9</p> <p><strong>Explanation:</strong></p> <p>The maximum difference occurs with i = 0 and j = 3, nums[j] - nums[i] = 10 - 1 = 9.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == nums.length</code></li> <li><code>2 <= n <= 1000</code></li> <li><code>1 <= nums[i] <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maximumDifference(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maximumDifference

public int maximumDifference(int[] nums)