refactor 340

fishercoder1534 · fishercoder1534 · commit f2d88f154a21 · 2020-06-06T08:17:49.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_340.java b/src/main/java/com/fishercoder/solutions/_340.java
@@ -3,16 +3,6 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**
- * 340. Longest Substring with At Most K Distinct Characters
- *
- * Given a string, find the length of the longest substring T that contains at most k distinct characters.
-
- For example, Given s = “eceba” and k = 2,
-
- T is "ece" which its length is 3.
-
- */
 public class _340 {
 
     public static class Solution1 {
@@ -29,7 +19,9 @@ public int lengthOfLongestSubstringKDistinct(String s, int k) {
                     num++;
                 }
                 if (num > k) {
-                    while (--count[s.charAt(left++)] > 0) {};
+                    while (--count[s.charAt(left++)] > 0) {
+                    }
+                    ;
                     num--;
                 }
                 result = Math.max(result, right - left + 1);
@@ -39,7 +31,9 @@ public int lengthOfLongestSubstringKDistinct(String s, int k) {
     }
 
     public static class Solution2 {
-        /**This is a more generic solution for any characters, not limited to ASCII characters.*/
+        /**
+         * This is a more generic solution for any characters, not limited to ASCII characters.
+         */
         public int lengthOfLongestSubstringKDistinct(String s, int k) {
             Map<Character, Integer> map = new HashMap<>();
             int longest = 0;
