Sentence Screen Fitting

Given a rows x cols screen and a sentence represented by a list of words, find how many times the given sentence can be fitted on the screen.

Note:

1. A word cannot be split into two lines.
2. The order of words in the sentence must remain unchanged.
3. Two consecutive words in a line must be separated by a single space.
4. Total words in the sentence won't exceed 100.
5. Length of each word won't exceed 10.
6. 1 ≤ rows, cols ≤ 20,000.

Example 1:

Input:
rows = 2, cols = 8, sentence = ["hello", "world"]

Output: 
1

Explanation:
hello---
world---

The character '-' signifies an empty space on the screen.

Example 2:

Input:
rows = 3, cols = 6, sentence = ["a", "bcd", "e"]

Output: 
2

Explanation:
a-bcd- 
e-a---
bcd-e-

The character '-' signifies an empty space on the screen.

Example 3:

Input:
rows = 4, cols = 5, sentence = ["I", "had", "apple", "pie"]

Output: 
1

Explanation:
I-had
apple
pie-I
had--

The character '-' signifies an empty space on the screen.

思路：这题我是看的答案，感觉太精妙了。

算法就是，其实每次fill每一行都是加上一些空格，和减去一些空格。如果我们先生成所需要的input给框框的string，那么我们只需要计算put满这个框框最后一行的下一行的开头的在这个目标string里面index是多少，然后用index / s.length()，就是s出现的次数，也就是我们filing了多少次s string。

那么每次加col的length，就会出现两种情况，

一种是刚好filing in, 那么 s.charAt(start % l) == ' ',那么直接跳到下一个字母。（注意，字母之间的间隔就是' ');

另外一种就是刚好跳到string word的中间，那么start就要后退，也就是上一行的尾巴需要append空格，start就要后退。

整体的思想就是生成目标string，然后用加空格和减空格的方法去找每行的其实位置，找到最后一行下一行的位置的index，最后除以s.length();就是次数。

注意：目标string是所有单词中间加一个空格，然后最后还要加一个空格，我觉得最后这个空格主要是为了统一计算用的，好让index挪动到下一个字符。

详细解释： https://discuss.leetcode.com/topic/62455/21ms-18-lines-java-solution/2

public class Solution {
    public int wordsTyping(String[] sentence, int rows, int cols) {
        if(sentence == null || sentence.length == 0 || rows<=0 || cols <=0) return 0;
        String s = String.join(" ", sentence) + " ";
        int l = s.length();
        int start = 0;
        for(int i=0; i<rows; i++){
            start += cols;
            if(s.charAt(start % l) == ' '){
                start++;
            } else {
                while(start > 0 && s.charAt((start-1) % l) != ' '){
                    start--;
                } 
            }
        }
        return start/l;
    }
}