• [LeetCode] 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 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].

    简单题,而且我写应用的时候写过这个,[UWP] 自定义一个ItemsPanel

    不多讲了,直接上代码

    vector<int> numberOfLines(vector<int>& widths, string S) {
        int line_count = 1, width = 0;
        for (char c : S)
        {
            int tmp = widths.at(c - 'a');
            if (width + tmp <= 100)
            {
                width += tmp;
            }
            else
            {
                ++line_count;
                width = tmp;
            }
        }
    
        return {line_count, width};
    }
    
  • 相关阅读:
    select poll使用
    linux下tomcat shutdown后 java进程依然存在
    poj 1222 EXTENDED LIGHTS OUT(高斯消元)
    poj 2377 Bad Cowtractors
    C#:总结页面传值几种方法
    从 Racket 入门函数式编程
    程序猿接私活经验总结,来自csdn论坛语录
    什么是SEO?SEO干嘛的?怎么做SEO?
    Java设计模式-观察者模式
    非常特别的一个动态规划新手教程
  • 原文地址:https://www.cnblogs.com/arcsinw/p/9447556.html
Copyright © 2020-2023  润新知