Optimized the code

pomkarnath98 · pomkarnath98 · commit b8a519399a8a · 2020-10-04T00:59:07.000+05:30
diff --git a/Dynamic-Programming/LongestCommonSubsequence.js b/Dynamic-Programming/LongestCommonSubsequence.js
@@ -23,7 +23,7 @@ function longestCommonSubsequence(x, y, str1, str2, dp) {
 function main() {
   const str1 = "ABCDGH"
   const str2 = "AEDFHR"
-  let dp = new Array(str1.length + 1).fill(0).map(x => new Array(str2.length + 1).fill(0))
+  const dp = new Array(str1.length + 1).fill(0).map(x => new Array(str2.length + 1).fill(0))
   const res = longestCommonSubsequence(str1.length - 1, str2.length - 1, str1, str2, dp)
   console.log(res);
 }

Original file line number	Diff line number	Diff line change
`@@ -23,7 +23,7 @@ function longestCommonSubsequence(x, y, str1, str2, dp) {`
`23`	`23`	`function main() {`
`24`	`24`	`const str1 = "ABCDGH"`
`25`	`25`	`const str2 = "AEDFHR"`
`26`		`- let dp = new Array(str1.length + 1).fill(0).map(x => new Array(str2.length + 1).fill(0))`
	`26`	`+ const dp = new Array(str1.length + 1).fill(0).map(x => new Array(str2.length + 1).fill(0))`
`27`	`27`	`const res = longestCommonSubsequence(str1.length - 1, str2.length - 1, str1, str2, dp)`
`28`	`28`	`console.log(res);`
`29`	`29`	`}`