Commit17883d1

committed

add 241

1 parentb702a48 commit17883d1Copy full SHA for 17883d1

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+/**`
	`2`	`+ *@param {string} input`
	`3`	`+ *@return {number[]}`
	`4`	`+ */`
	`5`	`+// slow, we can use dp to cache some results`
	`6`	`+vardiffWaysToCompute=function(input){`
	`7`	`+varresults=[];`
	`8`	`+for(vari=0;i<input.length;i++){`
	`9`	`+if(input[i]==='-'\|\|input[i]==='+'\|\|input[i]==='*'){`
	`10`	`+console.log(input);`
	`11`	`+varinputLeft=diffWaysToCompute(input.substring(0,i));`
	`12`	`+varinputRight=diffWaysToCompute(input.substring(i+1));`
	`13`	`+for(varj=0;j<inputLeft.length;j++){`
	`14`	`+for(vark=0;k<inputRight.length;k++){`
	`15`	`+varresult;`
	`16`	`+if(input[i]==='-'){`
	`17`	`+result=parseInt(inputLeft[j])-parseInt(inputRight[k]);`
	`18`	`+}elseif(input[i]==='+'){`
	`19`	`+result=parseInt(inputLeft[j])+parseInt(inputRight[k]);`
	`20`	`+}elseif(input[i]==='*'){`
	`21`	`+result=parseInt(inputLeft[j])*parseInt(inputRight[k]);`
	`22`	`+}`
	`23`	`+results.push(result);`
	`24`	`+}`
	`25`	`+}`
	`26`	`+}`
	`27`	`+}`
	`28`	`+`
	`29`	`+if(results.length===0)results.push(parseInt(input));`
	`30`	`+`
	`31`	`+returnresults;`
	`32`	`+};`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -95,6 +95,7 @@`
`95`	`95`	`*[230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) -[Solution](./Medium/230-kthSmallestElementinBST.js)`
`96`	`96`	`*[238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) -[Solution](./Medium/238-productExceptSelf.js)`
`97`	`97`	`*[240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) -[Solution](./Medium/240-Search2DMatrixII.js)`
	`98`	`+*[241. Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/) -[Solution](./Medium/241-differentWaysAddParentheses.js)`
`98`	`99`	`*[260. Single Number III](https://leetcode.com/problems/single-number-iii/) -[Solution](./Medium/260-singleNumberIII.js)`
`99`	`100`	`*[268. Missing Number](https://leetcode.com/problems/missing-number/) -[Solution](./Medium/268-missingNumber.js)`
`100`	`101`	`*[300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) -[Solution](./Medium/300-longestIncreasingSubsequence.js)`

Comments

(0)