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

题目大意: 给一个字符串S, 将S从左向右写入 lines 里,没一个line 长度为100. S中,每个字母出现的width 记录在widths 数组里。 例如"bbbcccdddaaa" [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]。 表明 b 写10次, 第二个b写10次一次类推。 当 写到第三个a时, 超出了100个限制,则将 第三个a 写入到 第二行中。 因此 总共有2行,最后一行有4个字符。

class Solution {
    public int[] numberOfLines(int[] widths, String S) {
        char[] charArray = S.toCharArray();
        int lines = 1;
        int lastLength = 0;
        int index = 0;
        for (char c : charArray) {
        	index = c - 'a';
        	lastLength += widths[index];
        	if (lastLength > 100) {
        		lines ++;
        		lastLength = widths[index];
    		}
		}
        return new int[] {lines, lastLength};
    }
}

你可能感兴趣的:(面试题,Leetcode,leetcode)