https://leetcode.cn/problems/split-message-based-on-limit

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/split-message-based-on-limit
+
 https://leetcode.cn/problems/count-ways-to-build-good-string
 
 https://leetcode.cn/problems/number-of-distinct-averages
@@ -129,8 +131,6 @@ https://leetcode.cn/problems/magical-string/
 
 https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/
 
-https://leetcode.cn/problems/split-message-based-on-limit
-
 https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof
 
 https://leetcode.cn/problems/count-of-matches-in-tournament/

split-message-based-on-limit/index.kt

@@ -24,7 +24,7 @@ class Solution {
                 val endIndex = Math.max(
                     0, Math.min(message.length, len + limit - 3 - (it + 1).toString().length - left.toString().length)
                 )
-//                println("${it},${len},${endIndex}")
+
                 val s = message.substring(len, endIndex) + "<${it + 1}/${left}>";
                 if (len == endIndex) return arrayOf()
                 len = endIndex

split-message-based-on-limit/index.ts

@@ -0,0 +1,31 @@
+export default function splitMessage(message: string, limit: number): string[] {
+    const n = message.length;
+    for (let i = 1, cap = 0, tail_len = 0;; ++i) {
+        if (i < 10) tail_len = 5; // 结尾的长度
+        else if (i < 100) {
+            if (i == 10) cap -= 9; // 前面的结尾的长度都 +1，那么容量就要减小
+            tail_len = 7;
+        } else if (i < 1000) {
+            if (i == 100) cap -= 99;
+            tail_len = 9;
+        } else {
+            if (i == 1000) cap -= 999;
+            tail_len = 11;
+        }
+        if (tail_len >= limit) return []; // cap 无法增大，寄
+        cap += limit - tail_len;
+        if (cap < n) continue; // 容量没有达到，继续枚举
+
+        const ans = Array<string>(i).fill("");
+        for (let j = 0, k = 0; j < i; ++j) {
+            const tail = "<" + (j + 1) + "/" + i + ">";
+            if (j == i - 1) ans[j] = message.substring(k) + tail;
+            else {
+                const m = limit - tail.length;
+                ans[j] = message.substring(k, k + m) + tail;
+                k += m;
+            }
+        }
+        return ans;
+    }
+}