Update Solution.java

javadev · web-flow · commit 28f504d1b5a2 · 2024-09-02T03:36:31.000+03:00
diff --git a/src/main/java/g3201_3300/s3272_find_the_count_of_good_integers/Solution.java b/src/main/java/g3201_3300/s3272_find_the_count_of_good_integers/Solution.java
@@ -46,7 +46,6 @@ private long calculateValidPermutations(String s) {
             long invalidPermutations = calculatePermutations(freq, n - 1);
             totalPermutations -= invalidPermutations;
         }
-
         return totalPermutations;
     }
 
@@ -80,10 +79,8 @@ private List<String> allKPalindromes(int n, int k) {
         for (int i = 1; i < n; i++) {
             rem[i] = (rem[i - 1] * 10) % k;
         }
-
         palindromes.clear();
         generatePalindromes(0, n - 1, k, 1, 0, ans, rem);
-
         return palindromes;
     }
 
@@ -95,7 +92,6 @@ public long countGoodIntegers(int n, int k) {
             Arrays.sort(arr);
             st.add(new String(arr));
         }
-
         List<String> v = new ArrayList<>(st);
         long chk = 0;
         for (String str : v) {

Original file line number	Diff line number	Diff line change
`@@ -46,7 +46,6 @@ private long calculateValidPermutations(String s) {`
`46`	`46`	`long invalidPermutations = calculatePermutations(freq, n - 1);`
`47`	`47`	`totalPermutations -= invalidPermutations;`
`48`	`48`	`}`
`49`		`-`
`50`	`49`	`return totalPermutations;`
`51`	`50`	`}`
`52`	`51`
`@@ -80,10 +79,8 @@ private List<String> allKPalindromes(int n, int k) {`
`80`	`79`	`for (int i = 1; i < n; i++) {`
`81`	`80`	`rem[i] = (rem[i - 1] * 10) % k;`
`82`	`81`	`}`
`83`		`-`
`84`	`82`	`palindromes.clear();`
`85`	`83`	`generatePalindromes(0, n - 1, k, 1, 0, ans, rem);`
`86`		`-`
`87`	`84`	`return palindromes;`
`88`	`85`	`}`
`89`	`86`
`@@ -95,7 +92,6 @@ public long countGoodIntegers(int n, int k) {`
`95`	`92`	`Arrays.sort(arr);`
`96`	`93`	`st.add(new String(arr));`
`97`	`94`	`}`
`98`		`-`
`99`	`95`	`List<String> v = new ArrayList<>(st);`
`100`	`96`	`long chk = 0;`
`101`	`97`	`for (String str : v) {`