class Solution:
def fullJustify(self, words: List[str], maxWidth: int) -> List[str]:
def findlen(level):
count = 0
for l in level:
count += len(l)
return count
n = len(words)
levels = []
level = []
index = 0
while index < n:
if len(level) == 0 and len(words[index]) <= maxWidth:
level.append(words[index])
index += 1
elif len(level) + findlen(level) + len(words[index]) <= maxWidth:
level.append(words[index])
index += 1
else:
levels.append(level)
level = []
levels.append(level)
res = []
for i in range(len(levels)):
temp = ""
length = len(levels[i])
if length == 1:
temp += levels[i][0]
for _ in range(maxWidth - len(levels[i][0])):
temp += " "
res.append(temp)
elif i == len(levels) - 1:
for j in range(length):
temp += levels[i][j]
if j != length - 1:
temp += " "
while len(temp) < maxWidth:
temp += " "
res.append(temp)
else:
block_num = maxWidth - findlen(levels[i])
blocks = [0] * (length - 1)
index = 0
while block_num:
blocks[index] += 1
block_num -= 1
index += 1
if index == len(blocks):
index = 0
for j in range(length):
temp += levels[i][j]
if j < length - 1:
for _ in range(blocks[j]):
temp += " "
res.append(temp)
return res
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· TypeScript + Deepseek 打造卜卦网站:技术与玄学的结合
· 阿里巴巴 QwQ-32B真的超越了 DeepSeek R-1吗?
· 【译】Visual Studio 中新的强大生产力特性
· 【设计模式】告别冗长if-else语句:使用策略模式优化代码结构
· 10年+ .NET Coder 心语 ── 封装的思维:从隐藏、稳定开始理解其本质意义