LeetCode-68. 文本左右对齐

        本人算法萌新,为秋招找工作开始磨炼算法,算法题均用python实现,如果我有哪些地方做的有问题的,还请大家不吝赐教.

1.题干

给定一个单词数组 words 和一个长度 maxWidth ，重新排版单词，使其成为每行恰好有 maxWidth 个字符，且左右两端对齐的文本。

你应该使用 “贪心算法” 来放置给定的单词；也就是说，尽可能多地往每行中放置单词。必要时可用空格 ' ' 填充，使得每行恰好有 maxWidth 个字符。

要求尽可能均匀分配单词间的空格数量。如果某一行单词间的空格不能均匀分配，则左侧放置的空格数要多于右侧的空格数。

文本的最后一行应为左对齐，且单词之间不插入额外的空格。

注意:

• 单词是指由非空格字符组成的字符序列。
• 每个单词的长度大于 0，小于等于 maxWidth。
• 输入单词数组 words 至少包含一个单词。

示例 1:

输入: words = ["This", "is", "an", "example", "of", "text", "justification."], maxWidth = 16
输出:
[
   "This    is    an",
   "example  of text",
   "justification.  "
]

示例 2:

输入:words = ["What","must","be","acknowledgment","shall","be"], maxWidth = 16
输出:
[
  "What   must   be",
  "acknowledgment  ",
  "shall be        "
]
解释: 注意最后一行的格式应为 "shall be    " 而不是 "shall     be",
     因为最后一行应为左对齐，而不是左右两端对齐。       
     第二行同样为左对齐，这是因为这行只包含一个单词。

示例 3:

输入:words = ["Science","is","what","we","understand","well","enough","to","explain","to","a","computer.","Art","is","everything","else","we","do"]，maxWidth = 20
输出:
[
  "Science  is  what we",
  "understand      well",
  "enough to explain to",
  "a  computer.  Art is",
  "everything  else  we",
  "do                  "
]

提示:

• 1 <= words.length <= 300
• 1 <= words[i].length <= 20
• words[i] 由小写英文字母和符号组成
• 1 <= maxWidth <= 100
• words[i].length <= maxWidth

2.思考

        一道模拟题目,细节比较多,但是不是很困难,我的想法是先求出每一行放的单词,再根据最大长度来计算空格,最后一行特殊处理

3.代码

from typing import List


class Solution:
    def fullJustify(self, words: List[str], maxWidth: int) -> List[str]:
        n = len(words)
        s = [0] * n
        ans = [[] for _ in range(n)]
        count = 0
        result = []
        for i in range(n):
            for j in range(count, n):
                if len(words[j]) + s[i] + len(ans[i]) > maxWidth:
                    break
                else:
                    ans[i].append(words[j])
                    s[i] += len(words[j])
                    count += 1
        last_index = 0
        for i in range(n):
            string = ""
            if i + 1 == n:
                last_index = i
                break
            if len(ans[i + 1]) == 0:
                last_index = i
                break
            length = 0
            for word in ans[i]:
                length += len(word)
            space = maxWidth - length
            if len(ans[i]) - 1 == 0:
                string = ans[i][0] + (" " * space)

            elif space % (len(ans[i]) - 1) == 0:
                space //= len(ans[i]) - 1
                for j in range(len(ans[i])):
                    string += ans[i][j]
                    if j != len(ans[i]) - 1:
                        string += (" " * space)
            else:
                less_space = int(space / (len(ans[i]) - 1))
                more_space = int(space / (len(ans[i]) - 1)) + 1
                more_space_num = space % (len(ans[i]) - 1)
                for j in range(more_space_num):
                    string += ans[i][j]
                    if j != len(ans[i]) - 1:
                        string += (" " * more_space)
                for j in range(more_space_num, len(ans[i])):
                    string += ans[i][j]
                    if j != len(ans[i]) - 1:
                        string += (" " * less_space)
            result.append(string)
        length = 0
        string = ''
        for i in range(len(ans[last_index])):
            string += ans[last_index][i]
            length += len(ans[last_index][i])
            if i != len(ans[last_index]) - 1:
                string += " "
                length += 1
        string += " " * (maxWidth - length)
        result.append(string)
        return result

4.总结

        这道题细节很多,面试要考的话不一定能在很短时间内写出来