Example 1:
Input: limit = 2, shards = ["A:0:100", "B:40:110", "C:80:200", "D:210:300"]
Output: ["A:0:100", "B:40:110", "C:101:209", "D:210:300"]
Explanation:
Example 2:
Input: limit = 1, shards = ["A:0:100", "B:80:180"]
Output: ["A:0:100", "B:101:180"]
Example 3:
Input: limit = 2, shards = ["A:0:30", "B:0:31", "C:0:32", "D:0:100"]
Output: ["A:0:30", "B:0:31", "C:31:32", "D:32:100"]
Explanation:
You are implementing a shard management system for a distributed key-value store.
Each shard is represented as a string in the format "id:start:end", where the shard covers the inclusive key range [start, end].
Given an integer limit and an array shards, rebalance the shards so that:
limit shards.start ascending, then end ascending.limit active shards, shift that shard's start to the earliest key where coverage becomes strictly less than limit.start > end, delete that shard.start to the original maximum end. If a gap appears, extend the most recently kept shard to fill it.Return the rebalanced shards in the same "id:start:end" format. You may return them in any order.
Identifiers are distinct and do not contain colons.
Shard C cannot start at 80 because keys 80..100 are already covered by A and B. It shifts to 101. Then C is extended to 209 to fill the gap before D.
After A and B, shard C must move to 31. Shard D is processed later and must start after the saturated region, so it becomes 32:100.
1 <= limit <= 10^50 <= shards.length <= 10^4-10^9 <= start <= end <= 10^9"id:start:end".