Update Solution.java

javadev · web-flow · commit 9d0c3348455a · 2022-05-29T20:41:33.000+03:00
diff --git a/src/main/java/g2001_2100/s2060_check_if_an_original_string_exists_given_two_encoded_strings/Solution.java b/src/main/java/g2001_2100/s2060_check_if_an_original_string_exists_given_two_encoded_strings/Solution.java
@@ -23,7 +23,6 @@ static class Key {
     private Boolean[][][] memo;
 
     public boolean possiblyEquals(String s1, String s2) {
-
         this.s1 = s1;
         this.s2 = s2;
         memo = new Boolean[s1.length() + 1][s2.length() + 1][2000];
@@ -51,7 +50,6 @@ private void dfs(int i1, int i2, int diff) {
             stringMatched = memo[i1][i2][diff + 999];
             return;
         }
-
         List<int[]> indexNums1 = new ArrayList<>();
         int num1 = 0;
         int x1 = i1;
@@ -60,7 +58,6 @@ private void dfs(int i1, int i2, int diff) {
             indexNums1.add(new int[] {x1, num1});
             x1++;
         }
-
         List<int[]> indexNums2 = new ArrayList<>();
         int num2 = 0;
         int x2 = i2;
@@ -69,7 +66,6 @@ private void dfs(int i1, int i2, int diff) {
             indexNums2.add(new int[] {x2, num2});
             x2++;
         }
-
         if (diff == 0) {
             char c1 = s1.charAt(i1);
             char c2 = s2.charAt(i2);
@@ -107,7 +103,6 @@ private void dfs(int i1, int i2, int diff) {
                 }
             }
         }
-
         memo[i1][i2][diff + 999] = stringMatched;
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -23,7 +23,6 @@ static class Key {`
`23`	`23`	`private Boolean[][][] memo;`
`24`	`24`
`25`	`25`	`public boolean possiblyEquals(String s1, String s2) {`
`26`		`-`
`27`	`26`	`this.s1 = s1;`
`28`	`27`	`this.s2 = s2;`
`29`	`28`	`memo = new Boolean[s1.length() + 1][s2.length() + 1][2000];`
`@@ -51,7 +50,6 @@ private void dfs(int i1, int i2, int diff) {`
`51`	`50`	`stringMatched = memo[i1][i2][diff + 999];`
`52`	`51`	`return;`
`53`	`52`	`}`
`54`		`-`
`55`	`53`	`List<int[]> indexNums1 = new ArrayList<>();`
`56`	`54`	`int num1 = 0;`
`57`	`55`	`int x1 = i1;`
`@@ -60,7 +58,6 @@ private void dfs(int i1, int i2, int diff) {`
`60`	`58`	`indexNums1.add(new int[] {x1, num1});`
`61`	`59`	`x1++;`
`62`	`60`	`}`
`63`		`-`
`64`	`61`	`List<int[]> indexNums2 = new ArrayList<>();`
`65`	`62`	`int num2 = 0;`
`66`	`63`	`int x2 = i2;`
`@@ -69,7 +66,6 @@ private void dfs(int i1, int i2, int diff) {`
`69`	`66`	`indexNums2.add(new int[] {x2, num2});`
`70`	`67`	`x2++;`
`71`	`68`	`}`
`72`		`-`
`73`	`69`	`if (diff == 0) {`
`74`	`70`	`char c1 = s1.charAt(i1);`
`75`	`71`	`char c2 = s2.charAt(i2);`
`@@ -107,7 +103,6 @@ private void dfs(int i1, int i2, int diff) {`
`107`	`103`	`}`
`108`	`104`	`}`
`109`	`105`	`}`
`110`		`-`
`111`	`106`	`memo[i1][i2][diff + 999] = stringMatched;`
`112`	`107`	`}`
`113`	`108`	`}`