806. Number of Lines To Write String
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.
Note:
- The length of
Swill be in the range [1, 1000]. Swill only contain lowercase letters.widthsis an array of length26.widths[i]will be in the range of[2, 10].
题意:
给出一个长度26的数组widths,保存着26个字母打印出来所需要的的屏幕宽度,而每行屏幕宽度都只有100,超过这个宽度的话,字母只能打印到下一行去,给出一段字符串,求出打印后最后一个字母所在的行数,列数。
class Solution:
def numberOfLines(self, widths, S):
sum = 0
line = 1
for i in S:
sum += widths[ord(i) - ord('a')]
if sum > 100:
sum = widths[ord(i) - ord('a')]
line += 1
return line, sum

本文介绍了一个算法问题,即如何计算给定字符串在特定宽度限制下的排版情况,包括所需的行数及最后一行使用的宽度。
418

被折叠的 条评论
为什么被折叠?



