[leetcode]Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
Solution:
public static int maxProfit(int[] prices) {
int total = 0;
for (int i = 0 ; i < prices.length - 1 ; i++){
if (prices[i+1] > prices[i]){
total += prices[i+1] - prices[i];
}
}
return total;
}
此题不难，据说在高盛面试中有遇到，注意数组越界的问题，saids:"arrogance is the first thing you want to avoid during interview"
blog comments powered by Disqus