Runtime: 28 ms (Top 95.86%) | Memory: 64.6 MB (Top 55.86%)

Author: AnasImloul

scripts/algorithms/C/Construct String With Repeat Limit/Construct String With Repeat Limit.java

@@ -1,3 +1,4 @@
+// Runtime: 28 ms (Top 95.86%) | Memory: 64.6 MB (Top 55.86%)
 class Solution {
     public String repeatLimitedString(String s, int repeatLimit) {
         int[] counter = new int[26];
@@ -16,11 +17,11 @@ public String repeatLimitedString(String s, int repeatLimit) {
             if (counter[max] == 0) {
                 max = findNextMax(counter, max - 1);
                 repeated = 0;
-				continue;
-            } 
+                continue;
+            }
             if (repeated == repeatLimit) {
-				// Greedy, use the next possible char once and get back to curr.
-				// if no other char available, the curr word is the largest subsequence. 
+                // Greedy, use the next possible char once and get back to curr.
+                // if no other char available, the curr word is the largest subsequence.
                 int lower = findNextMax(counter, max - 1);
                 if (lower < 0) {
                     return builder.toString();
@@ -32,7 +33,7 @@ public String repeatLimitedString(String s, int repeatLimit) {
         }
         return builder.toString();
     }
-    
+
     private int findNextMax(int[] counter, int from) {
         int curr = from;
         while (curr >= 0) {
@@ -43,4 +44,4 @@ private int findNextMax(int[] counter, int from) {
         }
         return curr;
     }
-}
+}