Leetcode 806. Number of Lines To Write String （Java）

问题描述

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

解决方案

package test ;

import java.lang.* ;
import java.util.*;

class Solution {
    public int[] numberOfLines(int[] widths, String S) {
        int[] result = {0, 0} ;
        char[] ch = S.toCharArray() ;
        int len = ch.length ;

        int space = 0 ;
        for (int i = 0; i <= len - 1; i ++){
            if (100 - space >= widths[ch[i] - 'a']){
                space +=  widths[ch[i] - 'a'];
            }
            else{
                result[0] += 1 ;
                space = widths[ch[i] - 'a'] ;
            }
        }
        result[0] += 1 ;
        result[1] = space ;
        return result ;
//      return new int[]{lines, space} ; //返回数组的写法

//        int space = 0, lines = 1 ;
//        for (char c : S.toCharArray()){
//          space += widths[c - 'a'] ;
//          if (space > 100){
//              lines += 1 ;
//              space = widths[c - 'a'] ;
//          }       
//        }
//        result[0] = lines ;
//        result[1] = space ;
//        return result ;
    }
} 


public class Test{
    public static void main(String[] args){
        Solution s = new Solution() ;
        int[] 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} ;
        String S = "abcdefghijklmnopqrst" ;
        int[] re = new int[2] ;
        re = s.numberOfLines(widths, S) ;
        System.out.println("The result is :" + re[0] + " " + re[1]) ;
    }
}

我的想法是判断字符在该行是否能放下，能放下的话增加已放空间，放不下的话放到下一行。
注释掉的内容实在网站上看到的其他的人解法，先放字符，超过空间的话放到下一行。