-
Notifications
You must be signed in to change notification settings - Fork 0
/
0302Leetcode.js
55 lines (38 loc) · 1.41 KB
/
0302Leetcode.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/* You are given an array prices where prices[i] is the price of a given stock on the ith day.
You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.
Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Example 1:
Input: prices = [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.
Example 2:
Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.
Constraints:
1 <= prices.length <= 105
0 <= prices[i] <= 104 */
// var maxProfit = function (prices) {
// let maxNum = Math.max(...prices)
// let minNum = Math.min(...prices)
// for (let i = 0; i < prices.length; i++){
// if (prices.indexOf(maxNum) > prices.indexOf(minNum)) {
// return maxNum - minNum
// }
// }
// };
var maxProfit = function(prices) {
var min = Number.MAX_SAFE_INTEGER;
// let min = 0;
console.log(min)
var max = 0;
for (var i = 0; i < prices.length; i++) {
min = Math.min(min, prices[i]);
console.log(`${i} ${min}`);
max = Math.max(max, prices[i] - min);
console.log(`${i} ${max}`);
}
return max;
};
console.log(maxProfit([7,1,5,3,6,4]));