前言
很多好的算法题目来源,请搜查:
题目
solu
class Solution {
public int maxProfit(int[] arr) {
if (arr == null || arr.length == 0) return 0;
int max_profit = 0;
int min = arr[0];
for (int i = 0; i < arr.length; i++) {
if (arr[i] < min) min = arr[i];
if ((arr[i] - min) > max_profit) max_profit = arr[i] - min;
}
return max_profit;
}
}
Runtime: 1 ms, faster than 99.88% of Java online submissions for Best Time to Buy and Sell Stock.