Merge branch 'main' into main

Author: yanglbme

solution/3000-3099/3008.Find Beautiful Indices in the Given Array II/README.md

@@ -154,7 +154,8 @@ public class Solution {
             }
 
             if (j == M) {
-                result.add(i - j); // Pattern found at index i-j+1 (If you have to return 1 Based indexing, that's why added + 1)
+                result.add(i - j); // Pattern found at index i-j+1 (If you have to return 1 Based
+                                   // indexing, that's why added + 1)
                 j = lps[j - 1];
             } else if (i < N && pat.charAt(j) != txt.charAt(i)) {
                 if (j != 0) {
@@ -196,11 +197,13 @@ public class Solution {
         for (int i : i_indices) {
 
             int left_limit = Math.max(0, i - k); // To avoid out of bound -> I used max(0, i-k)
-            int right_limit = Math.min(n - 1, i + k); // To avoid out of bound -> I used min(n-1, i+k)
+            int right_limit
+                = Math.min(n - 1, i + k); // To avoid out of bound -> I used min(n-1, i+k)
 
             int lowerBoundIndex = lowerBound(j_indices, left_limit);
 
-            if (lowerBoundIndex < j_indices.size() && j_indices.get(lowerBoundIndex) <= right_limit) {
+            if (lowerBoundIndex < j_indices.size()
+                && j_indices.get(lowerBoundIndex) <= right_limit) {
                 result.add(i);
             }
         }

solution/3000-3099/3008.Find Beautiful Indices in the Given Array II/README_EN.md

@@ -152,7 +152,8 @@ public class Solution {
             }
 
             if (j == M) {
-                result.add(i - j); // Pattern found at index i-j+1 (If you have to return 1 Based indexing, that's why added + 1)
+                result.add(i - j); // Pattern found at index i-j+1 (If you have to return 1 Based
+                                   // indexing, that's why added + 1)
                 j = lps[j - 1];
             } else if (i < N && pat.charAt(j) != txt.charAt(i)) {
                 if (j != 0) {
@@ -194,11 +195,13 @@ public class Solution {
         for (int i : i_indices) {
 
             int left_limit = Math.max(0, i - k); // To avoid out of bound -> I used max(0, i-k)
-            int right_limit = Math.min(n - 1, i + k); // To avoid out of bound -> I used min(n-1, i+k)
+            int right_limit
+                = Math.min(n - 1, i + k); // To avoid out of bound -> I used min(n-1, i+k)
 
             int lowerBoundIndex = lowerBound(j_indices, left_limit);
 
-            if (lowerBoundIndex < j_indices.size() && j_indices.get(lowerBoundIndex) <= right_limit) {
+            if (lowerBoundIndex < j_indices.size()
+                && j_indices.get(lowerBoundIndex) <= right_limit) {
                 result.add(i);
             }
         }