LeetCode: Best Time To Buy And Sell Stock II Solution
1var maxProfit = function (prices) {2 const N = prices.length3 let profit = 04 for (let i = 1; i < N; i++) {5 if (prices[i] > prices[i - 1]) {6 profit += prices[i] - prices[i - 1]7 }8 }9 return profit10}
Comments
Loading comments...
Tags
leetcode
array
greedy
Apply and earn a $2,500 bonus once you're hired on your first job!
Clients from the Fortune 500 to Silicon Valley startups
Choose your own rate, get paid on time
From hourly, part-time, to full-time positions
Flexible remote working environment
A lot of open JavaScript jobs!!
Fact corner: Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.
Still hesitate? Read HoningJS author's guide on dealing with Toptal interview process.
Previous Post
LeetCode: Number Of 1 Bits
Shift bit and check