Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3474_lexicographically_smallest_generated_string/Solution.java

@@ -30,22 +30,20 @@ public String generateString(String str1, String str2) {
             return String.join("", java.util.Collections.nCopies(l, "a"));
         }
         for (int i = 0; i < n; i++) {
-            if (str1.charAt(i) == 'F') {
-                if (intervalEquals(word, str2, i, m)) {
-                    boolean fixed = false;
-                    for (int j = m - 1; j >= 0; j--) {
-                        int pos = i + j;
-                        if (free[pos]) {
-                            word[pos] = 'b';
-                            free[pos] = false;
-                            fixed = true;
-                            break;
-                        }
-                    }
-                    if (!fixed) {
-                        return "";
+            if (str1.charAt(i) == 'F' && intervalEquals(word, str2, i, m)) {
+                boolean fixed = false;
+                for (int j = m - 1; j >= 0; j--) {
+                    int pos = i + j;
+                    if (free[pos]) {
+                        word[pos] = 'b';
+                        free[pos] = false;
+                        fixed = true;
+                        break;
                     }
                 }
+                if (!fixed) {
+                    return "";
+                }
             }
         }
         StringBuilder sb = new StringBuilder();

src/test/java/g3401_3500/s3474_lexicographically_smallest_generated_string/SolutionTest.java

@@ -20,4 +20,9 @@ void generateString2() {
     void generateString3() {
         assertThat(new Solution().generateString("F", "d"), equalTo("a"));
     }
+
+    @Test
+    void generateString4() {
+        assertThat(new Solution().generateString("TTFFT", "fff"), equalTo(""));
+    }
 }