forked from carpeventus/coding-interviews
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMaxDiff.java
More file actions
25 lines (23 loc) · 945 Bytes
/
MaxDiff.java
File metadata and controls
25 lines (23 loc) · 945 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
package Chap6;
/**
* 假设某股票的价格按照时间先后顺序存储在数组中，问买卖该股票一次可能获得的最大利润是多少？
* 如一支股票在某段时间内的价格为{9, 11, 8, 5, 7, 12, 16, 14}那么能在价格为5的时候购入并在价格为16时卖出，能获得最大利润11
*/
public class MaxDiff {
public int getMaxDiff(int[] prices) {
if (prices == null || prices.length < 2) return 0;
int min = prices[0];
int maxDiff = 0;
for (int i = 1; i < prices.length; i++) {
if (prices[i] < min) min = prices[i];
int curDiff = prices[i] - min;
if (curDiff > maxDiff) maxDiff = curDiff;
}
return maxDiff;
}
public static void main(String[] args) {
int[] prices = {9, 11, 8, 5, 7, 12, 16, 14};
MaxDiff maxDiff = new MaxDiff();
System.out.println(maxDiff.getMaxDiff(prices));
}
}