Problem Description
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
Return 0 if the array contains less than 2 elements.
- You may assume that all the elements in the array are non-negative integers and fit in the 32-bit signed integer range.
- You may also assume that the difference will not overflow.
Try to solve it in linear time/space
1 <= |A| <= 106
1 <= Ai <= 109
Input Format
The first argument is an integer array A.
Output Format
Return an integer representing maximum difference between the successive elements in array A.
Example Input
A = [1, 10, 5]
Example Output
5
Example Explanation
The maximum difference is between 5 and 10, which is 5.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.
