carloscn
commented
1 year ago Analysis
int32_t maximum_difference(int32_t* nums, size_t nums_size)
{
int32_t ret = -1;
UTILS_CHECK_PTR(nums);
UTILS_CHECK_LEN(nums_size);
size_t i = 0, j = 0;
int32_t max = nums[1] - nums[0] - 1;
for (i = 0; i < nums_size; i ++) {
for (j = i; j < nums_size; j ++) {
int32_t delta = nums[j] - nums[i];
if (i < j) {
max = max < delta ? delta : max;
}
}
}
ret = max;
finish:
return ret;
}
Description
Given a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., 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: 4 Explanation: The maximum difference occurs with i = 1 and j = 2, nums[j] - nums[i] = 5 - 1 = 4. 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.
Example 2:
Input: nums = [9,4,3,2] Output: -1 Explanation: There is no i and j such that i < j and nums[i] < nums[j].
Example 3:
Input: nums = [1,5,2,10] Output: 9 Explanation: The maximum difference occurs with i = 0 and j = 3, nums[j] - nums[i] = 10 - 1 = 9.
Constraints:
n == nums.length 2 <= n <= 1000 1 <= nums[i] <= 109