Sentence Screen Fitting

Given a rows x cols screen and a sentence represented by a list of non-empty 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 is greater than 0 and 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.

思路：首先计算以每个word开头能够存满一个row的单词数目，存在dp array里面，为什么这么做，是因为开头的单词前面是没有空格的，所以计算好了之后，后面可以直接调用长度；不用再计算了；然后算总共所有行能存多少个单词，最后words数目/ sentence的长度，就是重复的次数；

class Solution {
    public int wordsTyping(String[] sentence, int rows, int cols) {
        int n = sentence.length;
        int[] dp = new int[n];
        // 计算以sentence[i] 开头的，一行，能存多少个word；
        for(int i = 0; i < n; i++) {
            int length = 0, words = 0, index = i;
            while(length + sentence[index % n].length() <= cols) {
                length += sentence[index % n].length();
                length++; // space;
                words++;
                index++;
            }
            dp[i] = words;
        }
        
        // 计算总共能存多少个words，最后除以n, 就是重复的遍数；
        int words = 0;
        for(int i = 0, index = 0; i < rows; i++) {
            words += dp[index];
            index = (dp[index] + index) % n;
        }
        return words / n;
    }
}