Commit49f55cf

committed

add: Predict the Winner

1 parent93e6ca6 commit49f55cfCopy full SHA for 49f55cf

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -73,6 +73,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`73`	`73`	`\|413\|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)\|[JavaScript](./src/arithmetic-slices/res.js)\|Medium\|`
`74`	`74`	`\|416\|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)\|[JavaScript](./src/partition-equal-subset-sum/res.js)\|Medium\|`
`75`	`75`	`\|434\|[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)\|[JavaScript](./src/number-of-segments-in-a-string/res.js)\|Easy\|`
	`76`	`+\|486\|[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)\|[JavaScript](./src/predict-the-winner/res.js)\|Medium\|`
`76`	`77`	`\|494\|[Target Sum](https://leetcode.com/problems/target-sum/)\|[JavaScript](./src/target-sum/res.js)\|Medium\|`
`77`	`78`	`\|516\|[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)\|[JavaScript](./src/longest-palindromic-subsequence/res.js)\|Medium\|`
`78`	`79`	`\|523\|[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)\|[JavaScript](./src/continuous-subarray-sum/res.js)\|Medium\|`

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,40 @@`
	`1`	`+/**`
	`2`	`+ * res.js`
	`3`	`+ *@param {number[]} nums`
	`4`	`+ *@return {boolean}`
	`5`	`+ */`
	`6`	`+letPredictTheWinner=function(nums){`
	`7`	`+letlen=nums.length,`
	`8`	`+res=newArray(len).fill([]);`
	`9`	`+`
	`10`	`+for(leti=len-1;i>=0;i--){`
	`11`	`+for(letj=i;j<len;j++){`
	`12`	`+if(i==j)res[i]=nums[i];`
	`13`	`+elseres[j]=Math.max(nums[i]-res[j],nums[j]-res[j-1]);`
	`14`	`+}`
	`15`	`+}`
	`16`	`+`
	`17`	`+returnres[len-1]>=0;`
	`18`	`+};`
	`19`	`+`
	`20`	`+// Solution 2: tranditional way`
	`21`	`+// let PredictTheWinner = function(nums) {`
	`22`	`+// let len = nums.length,`
	`23`	`+// res = [];`
	`24`	`+`
	`25`	`+// for (let i=0; i<len; i++) {`
	`26`	`+// res.push(new Array(len));`
	`27`	`+// }`
	`28`	`+`
	`29`	`+// if (helper(nums, 0, len-1, res) >= 0) return true;`
	`30`	`+// else return false;`
	`31`	`+// };`
	`32`	`+`
	`33`	`+// let helper = function(nums, start, end, res) {`
	`34`	`+// if (start === end)`
	`35`	`+// res[start][end] = nums[start];`
	`36`	`+// else`
	`37`	`+// res[start][end] = Math.max(nums[start]-helper(nums, start+1, end, res), nums[end]-helper(nums, start, end-1, res));`
	`38`	`+`
	`39`	`+// return res[start][end];`
	`40`	`+// }`

Comments

(0)