[leetCode]119.Pascal's Triangle II
2017-01-05 16:14
323 查看
题目描述
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.
Example 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5
max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
Example 2:
Input: [7, 6, 4, 3, 1]
Output: 0
In this case, no transaction is done, i.e. max profit = 0.
java代码(此题过于简单,暂无分析)
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.
Example 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5
max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
Example 2:
Input: [7, 6, 4, 3, 1]
Output: 0
In this case, no transaction is done, i.e. max profit = 0.
java代码(此题过于简单,暂无分析)
public int maxProfit(int[] prices) { int min = 0; int profit = 0; for (int i = 0; i < prices.length; i++){ if (prices[i] > prices[min]) profit = Math.max(profit, prices[i] - prices[min]); else if (prices[i] < prices[min]) min = i; } return profit; }
相关文章推荐
- 【LeetCode】119. Pascal's Triangle II
- leetcode 119 Pascal's Triangle II(array)
- [leetcode]119. Pascal's Triangle II
- 【LeetCode】119 Pascal's Triangle II
- Leetcode_c++: Pascal's TriangleII (119)
- ※ Leetcode - Dynamic Programming - 119. Pascal's Triangle II(倒叙滚动数组求解杨辉三角第k行)
- LeetCode - 119. Pascal's Triangle II
- LeetCode-119-Pascal's Triangle II-E
- [LeetCode]--119. Pascal's Triangle II
- 119. Pascal's triangle II Leetcode Python
- leetcode_question_119 Pascal's Triangle II
- Leetcode题解 119. Pascal's Triangle II
- leetcode119. Pascal's Triangle II
- [leetCode]119.Pascal's Triangle II
- leetcode题解-118. Pascal's Triangle && 119. Pascal's Triangle II
- 【leetcode】119. Pascal's Triangle II【java】
- LeetCode力扣之119. Pascal's Triangle II
- LeetCode 119. Pascal's Triangle II
- Leetcode 119. Pascal's Triangle II 杨辉三角2 解题报告
- [LeetCode] 119. Pascal's Triangle II