时间复杂度:O(N)
空间复杂度:2N
pseudocode:
maxDirectedDiff(array[] a) {
minNumber[] m
m[1] = a[1]
for i = 2 ... a.length
m = a[i] < m[i-1] ? a[i] : m[i-1]
result = MIN_INT
for i = 2 ... a.length
result = a[i] - m[i-1] > result ? a[i] - m[i-1] : result
return result
}