首页 > 代码库 > Problem Best Time to Buy and Sell Stock I
Problem Best Time to Buy and Sell Stock I
Problem Description:
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Solution:
1 public int maxProfit(int[] prices) { 2 if (prices.length <= 1) return 0; 3 int max = 0; 4 int low = prices[0]; 5 for (int i = 0; i < prices.length; i++){ 6 low = Math.min(low, prices[i]); 7 max = Math.max(max, prices[i] - low); 8 } 9 return max;10 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。