add 2138

fishercoder1534 · fishercoder1534 · commit bc602923ea41 · 2022-01-16T09:16:47.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2138|[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2138.java) ||Easy||
 |2134|[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2134.java) ||Medium||
 |2133|[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2133.java) ||Easy||
 |2130|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2130.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2138.java b/src/main/java/com/fishercoder/solutions/_2138.java
@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+public class _2138 {
+    public static class Solution1 {
+        public String[] divideString(String s, int k, char fill) {
+            int len = s.length() / k;
+            if (s.length() % k != 0) {
+                len++;
+            }
+            String[] ans = new String[len];
+            for (int i = 0, j = 0; i < s.length(); i += k, j++) {
+                if (j == len - 1) {
+                    StringBuilder sb = new StringBuilder(s.substring(i));
+                    if (sb.length() != k) {
+                        while (sb.length() < k) {
+                            sb.append(fill);
+                        }
+                    }
+                    ans[j] = sb.toString();
+                } else {
+                    ans[j] = s.substring(i, i + k);
+                }
+            }
+            return ans;
+        }
+    }
+}
