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

字符串的占位统计。

每行有100个空位,widths表示每个字符所占的空间大小,如果末尾不能容纳一个字符,那么就将其移动至下一行。

统计字符串占据的行数及最后一行所占的空间大小。

class Solution {
public:
    vector<int> numberOfLines(vector<int>& widths, string S) {
        int m = 0, n = 0;
        for (int i = 0; i < S.size(); ++i)
        {
            m += widths[(S[i]-‘a‘)];
            if (m >= 100)
            {
                if (m == 100)
                {
                    n++;
                    m = 0;
                }
                else
                {
                    n++;
                    m = widths[(S[i]-‘a‘)];
                }
            }
        }
        return {n+1, m};
    }
};

原文地址:https://www.cnblogs.com/immjc/p/9149051.html

时间: 2024-10-08 15:38:40

[LeetCode] Number of Lines To Write String的相关文章

Leetcode: 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:

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&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(Java实现)

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

[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

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

#Leetcode# 434. Number of Segments in a String

https://leetcode.com/problems/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 cha

2016.5.16——leetcode:Number of 1 Bits ,

leetcode:Number of 1 Bits 1.Number of 1 Bits 本题收获: 1.Hamming weight:即二进制中1的个数 2.n &= (n-1)[n = n & (n-1)]的用处 题目: Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight). For exam

每天一道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 (