[Leetcode] 806. Number of Lines To Write String 解题报告

最新推荐文章于 2022-04-07 21:35:54 发布

原创最新推荐文章于 2022-04-07 21:35:54 发布 · 440 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode #解题报告 #string

IT公司面试习题专栏收录该内容

736 篇文章

订阅专栏

本文介绍了一个简单的算法，用于计算给定字符串在限定宽度下所需的排版行数及最后一行使用的宽度。通过遍历字符串并利用字符宽度数组，该算法能够有效地得出答案。

题目：

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 S will be in the range [1, 1000].
S will only contain lowercase letters.
widths is an array of length 26.
widths[i] will be in the range of [2, 10].

思路：

好不容易遇到一个练手题目。。。

代码：

class Solution {
public:
    vector<int> numberOfLines(vector<int>& widths, string S) {
        if (S.length() == 0) {
            return {0, 0};
        }
        int line_count = 1, char_count = 0;
        for (auto c : S) {
            int width = widths[c - 'a'];
            if (char_count + width <= 100) {
                char_count += width;
            }
            else {
                ++line_count;
                char_count = width;
            }
        }
        return {line_count, char_count};
    }
};