806. Number of Lines To Write String (5月24日)

解答

class Solution {
public:
    vector<int> numberOfLines(vector<int>& widths, string S) {
        vector<int> result;
        int line=1,units=0;
        map<char,int> pairs;
        char c=‘a‘;
        for(int width:widths){
            pairs.insert(make_pair(c,width));
            ++c;
        }
        for(auto ch: S){
            units += pairs[ch];
            if(units > 100){
                 ++line;
                 units=pairs[ch];
            }
        }
        result.push_back(line);
        result.push_back(units);
        return result;
    }
};

原文地址:https://www.cnblogs.com/cs-niaocai/p/9085726.html

时间: 2024-07-31 12:34:54

806. Number of Lines To Write String (5月24日)的相关文章

[LeetCode&amp;Python] Problem 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 arra

leetCode题解之Number of Lines To Write String

1.题目描述 2.分析 使用一个map将字母和数字对应起来,方便后续使用. 3.代码 1 vector<int> numberOfLines(vector<int>& widths, string S) { 2 map<char,int> m; 3 vector<int> ans; 4 5 for( int i = 0; i< 26;i++) 6 m[i+'a'] = widths[i]; 7 8 int lines = 1; 9 int cu

[LeetCode] 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 arra

[Swift]LeetCode806. 写字符串需要的行数 | 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 arra

LeetCode算法题-Number of Lines To Write String(Java实现)

这是悦乐书的第319次更新,第340篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第188题(顺位题号是806).我们要将给定字符串S的字母从左到右写成行.每行最大宽度为100个单位,如果写一个字母会导致该行的宽度超过100个单位,则会写入下一行.给出一个数组宽度,一个数组,其中widths[0]是'a'的宽度,widths[1]是'b'的宽度,widths[25]是'z'的宽度. 现在回答两个问题:S中至少有一个字符有多少行,最后一行使用的宽度是多少?将答案作为长

每天一道LeetCode--434. Number of Segments in a String

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters. For example, Input: "Hello, my name is John" Output: 5 public int countSegments(String s) { String trimmed = s.trim(); if (

434. 求字符串有多少段 Number of Segments in a String

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters. Please note that the string does not contain any non-printable characters. Example: Input: "Hello, my name is John" Output:

Number of Segments in a String

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters. Please note that the string does not contain any non-printable characters. Example: Input: "Hello, my name is John" Output:

434. Number of Segments in a String

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters. Please note that the string does not contain any non-printable characters. Example: Input: "Hello, my name is John" Output: