leet806. Number of Lines To Write String

最新推荐文章于 2020-01-18 16:54:28 发布

原创最新推荐文章于 2020-01-18 16:54:28 发布 · 233 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #python #算法 #字符串 #字典

Python 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了一种用于计算字符串在特定宽度限制下的排版算法。该算法通过输入一系列字符宽度和目标字符串，来确定排版所需的行数及最后一行使用的宽度。文章提供了具体的实现代码，并通过两个实例展示了算法的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

We are to write the letters of a given string S, from left to right into lines. Each line has maximum width 100 units, and if writing a letter would cause the width of the line to exceed 100 units, it is written on the next line. We are given an array widths, an array where widths[0] is the width of 'a', widths[1] is the width of 'b', ..., and widths[25] is the width of 'z'.

Now answer two questions: how many lines have at least one character from S, and what is the width used by the last such line? Return your answer as an integer list of length 2.

Example :
Input: 
widths = [10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10]
S = "abcdefghijklmnopqrstuvwxyz"
Output: [3, 60]
Explanation: 
All letters have the same length of 10. To write all 26 letters,
we need two full lines and one line with 60 units.

Example :
Input: 
widths = [4,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10]
S = "bbbcccdddaaa"
Output: [2, 4]
Explanation: 
All letters except 'a' have the same length of 10, and 
"bbbcccdddaa" will cover 9 * 10 + 2 * 4 = 98 units.
For the last 'a', it is written on the second line because
there is only 2 units left in the first line.
So the answer is 2 lines, plus 4 units in the second line.

分析：

建立字母为键值，对应宽度为值的字典;
遍历字符，判断添加字符是否会超出一行宽度，若未超出，则继续，否则放入下一行

代码：

class Solution(object):
    def numberOfLines(self, widths, S):
        """
        :type widths: List[int]
        :type S: str
        :rtype: List[int]
        """
        alphaLst = map(chr,range(97,123))
        alphaWidDict = dict(zip(alphaLst,widths))
        sumWidth = 0 
        linesNum = 1
        for x in S:
            if alphaWidDict.get(x) < 100 - sumWidth:
                sumWidth += alphaWidDict.get(x)
            else:
                sumWidth = alphaWidDict.get(x)
                linesNum += 1
        return [linesNum,sumWidth] if S else [0,0]

思考：