【LeetCode】121.Best Time to Buy and Sell Stock(Easy)解题报告
2018-01-30 16:45
399 查看
【LeetCode】121.Best Time to Buy and Sell Stock(Easy)解题报告
题目地址:https://leetcode.com/problems/best-time-to-buy-and-sell-stock/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.
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.
Solution:
Date:2018年1月29日
题目地址:https://leetcode.com/problems/best-time-to-buy-and-sell-stock/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.
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.
Solution:
//time:O(n) //space:O(1) class Solution { public int maxProfit(int[] prices) { if(prices == null || prices.length < 2) return 0; int profit = 0; int min = prices[0]; for(int price : prices){ min = Math.min(min,price); profit = Math.max(profit,price - min); } return profit; } }
Date:2018年1月29日
相关文章推荐
- 【LeetCode】14.Longest Common Prefix(Easy)解题报告
- LeetCode解题报告 112. Path Sum [easy]
- 【LeetCode】118.Pascal's Triangle(easy)解题报告
- 【LeetCode】412.Fizz Buzz(easy)解题报告
- 【LeetCode】27.Remove Element(Easy)解题报告
- 【LeetCode】463.Island Perimeter(easy)解题报告
- LeetCode解题报告 102. Binary Tree Level Order Traversal [easy]
- 【LeetCode】88.Merge Sorted Array(easy)解题报告
- LeetCode解题报告 100. Same Tree [easy]
- 【LeetCode】26.Remove Duplicates from Sorted Array(Easy)解题报告
- 【LeetCode】53.Maximum Subarray(Easy)解题报告
- LeetCode解题报告 107. Binary Tree Level Order Traversal II [easy]
- 【LeetCode】270.Closest Binary Search Tree Value(Easy)解题报告
- LeetCode解题报告 455. Assign Cookies [easy]
- 【LeetCode】383.Ransom Note(Easy)解题报告
- 【LeetCode】235.Lowest Common Ancestor of a Binary Search Tree(Easy)解题报告
- 【LeetCode】119.Pascal's Triangle II(Easy)解题报告
- 【LeetCode】448.Find All Numbers Disappeared in an Array(Easy)解题报告
- LeetCode解题报告 349. Intersection of Two Arrays [easy]
- 【LeetCode】141.Linked List Cycle(easy)解题报告