Skip to content

Commit bab6edb

Browse files
solves maximum difference between increasing elements
1 parent 7345930 commit bab6edb

File tree

2 files changed

+17
-1
lines changed

2 files changed

+17
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -481,7 +481,7 @@
481481
| 2000 | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word) | [![Java](assets/java.png)](src/ReversePrefixOfWord.java) | |
482482
| 2006 | [Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k) | [![Java](assets/java.png)](src/CountNumberOfPairsWithAbsoluteDifferenceK.java) | |
483483
| 2011 | [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations) | [![Java](assets/java.png)](src/FinalValueOfVariableAfterPerformingOperations.java) | |
484-
| 2016 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements) | | |
484+
| 2016 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements) | [![Java](assets/java.png)](src/MaximumDifferenceBetweenIncreasingElements.java) | |
485485
| 2022 | [Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array) | | |
486486
| 2027 | [Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string) | | |
487487
| 2032 | [Two Out of Three](https://leetcode.com/problems/two-out-of-three) | | |
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
// https://leetcode.com/problems/maximum-difference-between-increasing-elements
2+
// T: O(N)
3+
// S: O(1)
4+
5+
public class MaximumDifferenceBetweenIncreasingElements {
6+
public int maximumDifference(int[] nums) {
7+
int maxDifference = -1;
8+
for (int index = nums.length - 2, currentMax = nums[nums.length - 1] ; index >= 0 ; index--) {
9+
if (currentMax > nums[index]) {
10+
maxDifference = Math.max(maxDifference, currentMax - nums[index]);
11+
}
12+
currentMax = Math.max(currentMax, nums[index]);
13+
}
14+
return maxDifference;
15+
}
16+
}

0 commit comments

Comments
 (0)