Add solution #343

Author: JoshCrozier

README.md

@@ -276,6 +276,7 @@
 338|[Counting Bits](./0338-counting-bits.js)|Easy|
 341|[Flatten Nested List Iterator](./0341-flatten-nested-list-iterator.js)|Medium|
 342|[Power of Four](./0342-power-of-four.js)|Easy|
+343|[Integer Break](./0343-integer-break.js)|Medium|
 344|[Reverse String](./0344-reverse-string.js)|Easy|
 345|[Reverse Vowels of a String](./0345-reverse-vowels-of-a-string.js)|Easy|
 347|[Top K Frequent Elements](./0347-top-k-frequent-elements.js)|Medium|

solutions/0343-integer-break.js

@@ -0,0 +1,24 @@
+/**
+ * 343. Integer Break
+ * https://leetcode.com/problems/integer-break/
+ * Difficulty: Medium
+ *
+ * Given an integer n, break it into the sum of k positive integers, where k >= 2,
+ * and maximize the product of those integers.
+ *
+ * Return the maximum product you can get.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var integerBreak = function(n) {
+  if (n <= 3) return n - 1;
+  let product = 1;
+  while (n > 4) {
+    product *= 3;
+    n -= 3;
+  }
+  return product * n;
+};