Add solution #553

Author: JoshCrozier

README.md

@@ -438,6 +438,7 @@
 547|[Number of Provinces](./0547-number-of-provinces.js)|Medium|
 551|[Student Attendance Record I](./0551-student-attendance-record-i.js)|Easy|
 552|[Student Attendance Record II](./0552-student-attendance-record-ii.js)|Hard|
+553|[Optimal Division](./0553-optimal-division.js)|Medium|
 557|[Reverse Words in a String III](./0557-reverse-words-in-a-string-iii.js)|Easy|
 560|[Subarray Sum Equals K](./0560-subarray-sum-equals-k.js)|Medium|
 563|[Binary Tree Tilt](./0563-binary-tree-tilt.js)|Easy|

solutions/0553-optimal-division.js

@@ -0,0 +1,27 @@
+/**
+ * 553. Optimal Division
+ * https://leetcode.com/problems/optimal-division/
+ * Difficulty: Medium
+ *
+ * You are given an integer array nums. The adjacent integers in nums will perform
+ * the float division.
+ * - For example, for nums = [2,3,4], we will evaluate the expression "2/3/4".
+ *
+ * However, you can add any number of parenthesis at any position to change the priority
+ * of operations. You want to add these parentheses such the value of the expression after
+ * the evaluation is maximum.
+ *
+ * Return the corresponding expression that has the maximum value in string format.
+ *
+ * Note: your expression should not contain redundant parenthesis.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {string}
+ */
+var optimalDivision = function(nums) {
+  if (nums.length === 1) return nums[0].toString();
+  if (nums.length === 2) return `${nums[0]}/${nums[1]}`;
+  return `${nums[0]}/(${nums.slice(1).join('/')})`;
+};