股票的最大利润

 1 public class Solution {
 2 
 3     public int maxDiff(int[] numbers) {
 4         if(numbers == null && numbers.length) {
 5             return 0;
 6         }
 7 
 8         int min = numbers[0];
 9         int maxDiff = numbers[1]-numbers[0];
10 
11         for(int i = 2; i < numbers.length; i++) {
12             
13             // you should know here numbers[i-1]
14             if(numbers[i-1] < min) {
15                 min = numbers[i-1];
16             }
17 
18             int currentDiff = numbers[i] - min;
19 
20             if(currentDiff > maxDiff) {
21                 maxDiff = currentDiff;
22             }
23         }
24 
25         return maxDiff;
26     }
27 
28 
29     public static void main(String[] args) {
30         Solution s = new Solution();
31         int[] data = {9,11,8,5,7,12,16,14};
32 
33         System.out.println(s.maxDiff(data));
34     }
35 }