Add solution #122

Author: JoshCrozier

README.md

@@ -127,6 +127,7 @@
 119|[Pascal's Triangle II](./0119-pascals-triangle-ii.js)|Easy|
 120|[Triangle](./0120-triangle.js)|Medium|
 121|[Best Time to Buy and Sell Stock](./0121-best-time-to-buy-and-sell-stock.js)|Easy|
+122|[Best Time to Buy and Sell Stock II](./0122-best-time-to-buy-and-sell-stock-ii.js)|Medium|
 124|[Binary Tree Maximum Path Sum](./0124-binary-tree-maximum-path-sum.js)|Hard|
 125|[Valid Palindrome](./0125-valid-palindrome.js)|Easy|
 128|[Longest Consecutive Sequence](./0128-longest-consecutive-sequence.js)|Medium|

solutions/0122-best-time-to-buy-and-sell-stock-ii.js

@@ -0,0 +1,24 @@
+/**
+ * 122. Best Time to Buy and Sell Stock II
+ * https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
+ * Difficulty: Medium
+ *
+ * You are given an integer array prices where prices[i] is the price of a given
+ * stock on the ith day.
+ *
+ * On each day, you may decide to buy and/or sell the stock. You can only hold at
+ * most one share of the stock at any time. However, you can buy it then immediately
+ * sell it on the same day.
+ *
+ * Find and return the maximum profit you can achieve.
+ */
+
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+var maxProfit = function(prices) {
+  return prices.reduce((result, price, i) => {
+    return prices[i - 1] < price ? result + (price - prices[i - 1]) : result;
+  }, 0);
+};