refactor 395

fishercoder1534 · fishercoder1534 · commit a75a40545bbd · 2017-09-17T08:47:35.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_395.java b/src/main/java/com/fishercoder/solutions/_395.java
@@ -35,6 +35,7 @@ public int longestSubstring(String s, int k) {
         }
 
         int findLongestSubstring(char[] chars, int start, int end, int k) {
+            /**Base case 1 of 2*/
             if (end - start < k) {
                 return 0;
             }
@@ -44,6 +45,7 @@ int findLongestSubstring(char[] chars, int start, int end, int k) {
                 count[index]++;
             }
 
+            /**For every character in the above frequency table*/
             for (int i = 0; i < 26; i++) {
                 if (count[i] < k && count[i] > 0) {
                     for (int j = start; j < end; j++) {
@@ -55,6 +57,8 @@ int findLongestSubstring(char[] chars, int start, int end, int k) {
                     }
                 }
             }
+            /**Base case 2 of 2:
+             * when any characters in this substring has repeated at least k times, then this entire substring is a valid answer*/
             return end - start;
         }
     }

Original file line number	Diff line number	Diff line change
`@@ -35,6 +35,7 @@ public int longestSubstring(String s, int k) {`
`35`	`35`	`}`
`36`	`36`
`37`	`37`	`int findLongestSubstring(char[] chars, int start, int end, int k) {`
	`38`	`+ /*Base case 1 of 2/`
`38`	`39`	`if (end - start < k) {`
`39`	`40`	`return 0;`
`40`	`41`	`}`
`@@ -44,6 +45,7 @@ int findLongestSubstring(char[] chars, int start, int end, int k) {`
`44`	`45`	`count[index]++;`
`45`	`46`	`}`
`46`	`47`
	`48`	`+ /*For every character in the above frequency table/`
`47`	`49`	`for (int i = 0; i < 26; i++) {`
`48`	`50`	`if (count[i] < k && count[i] > 0) {`
`49`	`51`	`for (int j = start; j < end; j++) {`
`@@ -55,6 +57,8 @@ int findLongestSubstring(char[] chars, int start, int end, int k) {`
`55`	`57`	`}`
`56`	`58`	`}`
`57`	`59`	`}`
	`60`	`+ /**Base case 2 of 2:`
	`61`	`+ * when any characters in this substring has repeated at least k times, then this entire substring is a valid answer*/`
`58`	`62`	`return end - start;`
`59`	`63`	`}`
`60`	`64`	`}`