fix: code style

Author: yanglbme

solution/2900-2999/2981.Find Longest Special Substring That Occurs Thrice I/README.md

@@ -126,7 +126,7 @@ class Solution {
 
     private boolean check(int x) {
         int[] cnt = new int[26];
-        for (int i = 0; i < n; ) {
+        for (int i = 0; i < n;) {
             int j = i + 1;
             while (j < n && s.charAt(j) == s.charAt(i)) {
                 j++;
@@ -153,7 +153,7 @@ public:
         int l = 0, r = n;
         auto check = [&](int x) {
             int cnt[26]{};
-            for (int i = 0; i < n; ) {
+            for (int i = 0; i < n;) {
                 int j = i + 1;
                 while (j < n && s[j] == s[i]) {
                     ++j;

solution/2900-2999/2981.Find Longest Special Substring That Occurs Thrice I/README_EN.md

@@ -116,7 +116,7 @@ class Solution {
 
     private boolean check(int x) {
         int[] cnt = new int[26];
-        for (int i = 0; i < n; ) {
+        for (int i = 0; i < n;) {
             int j = i + 1;
             while (j < n && s.charAt(j) == s.charAt(i)) {
                 j++;
@@ -143,7 +143,7 @@ public:
         int l = 0, r = n;
         auto check = [&](int x) {
             int cnt[26]{};
-            for (int i = 0; i < n; ) {
+            for (int i = 0; i < n;) {
                 int j = i + 1;
                 while (j < n && s[j] == s[i]) {
                     ++j;

solution/2900-2999/2981.Find Longest Special Substring That Occurs Thrice I/Solution.cpp

@@ -5,7 +5,7 @@ class Solution {
         int l = 0, r = n;
         auto check = [&](int x) {
             int cnt[26]{};
-            for (int i = 0; i < n; ) {
+            for (int i = 0; i < n;) {
                 int j = i + 1;
                 while (j < n && s[j] == s[i]) {
                     ++j;

solution/2900-2999/2981.Find Longest Special Substring That Occurs Thrice I/Solution.java

@@ -19,7 +19,7 @@ public int maximumLength(String s) {
 
     private boolean check(int x) {
         int[] cnt = new int[26];
-        for (int i = 0; i < n; ) {
+        for (int i = 0; i < n;) {
             int j = i + 1;
             while (j < n && s.charAt(j) == s.charAt(i)) {
                 j++;

solution/2900-2999/2982.Find Longest Special Substring That Occurs Thrice II/README.md

@@ -126,7 +126,7 @@ class Solution {
 
     private boolean check(int x) {
         int[] cnt = new int[26];
-        for (int i = 0; i < n; ) {
+        for (int i = 0; i < n;) {
             int j = i + 1;
             while (j < n && s.charAt(j) == s.charAt(i)) {
                 j++;
@@ -153,7 +153,7 @@ public:
         int l = 0, r = n;
         auto check = [&](int x) {
             int cnt[26]{};
-            for (int i = 0; i < n; ) {
+            for (int i = 0; i < n;) {
                 int j = i + 1;
                 while (j < n && s[j] == s[i]) {
                     ++j;

solution/2900-2999/2982.Find Longest Special Substring That Occurs Thrice II/README_EN.md

@@ -116,7 +116,7 @@ class Solution {
 
     private boolean check(int x) {
         int[] cnt = new int[26];
-        for (int i = 0; i < n; ) {
+        for (int i = 0; i < n;) {
             int j = i + 1;
             while (j < n && s.charAt(j) == s.charAt(i)) {
                 j++;
@@ -143,7 +143,7 @@ public:
         int l = 0, r = n;
         auto check = [&](int x) {
             int cnt[26]{};
-            for (int i = 0; i < n; ) {
+            for (int i = 0; i < n;) {
                 int j = i + 1;
                 while (j < n && s[j] == s[i]) {
                     ++j;

solution/2900-2999/2982.Find Longest Special Substring That Occurs Thrice II/Solution.cpp

@@ -5,7 +5,7 @@ class Solution {
         int l = 0, r = n;
         auto check = [&](int x) {
             int cnt[26]{};
-            for (int i = 0; i < n; ) {
+            for (int i = 0; i < n;) {
                 int j = i + 1;
                 while (j < n && s[j] == s[i]) {
                     ++j;

solution/2900-2999/2982.Find Longest Special Substring That Occurs Thrice II/Solution.java

@@ -19,7 +19,7 @@ public int maximumLength(String s) {
 
     private boolean check(int x) {
         int[] cnt = new int[26];
-        for (int i = 0; i < n; ) {
+        for (int i = 0; i < n;) {
             int j = i + 1;
             while (j < n && s.charAt(j) == s.charAt(i)) {
                 j++;