418. Sentence Screen Fitting

Description

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:

A word cannot be split into two lines.
The order of words in the sentence must remain unchanged.
Two consecutive words in a line must be separated by a single space.
Total words in the sentence won’t exceed 100.
Length of each word is greater than 0 and won’t exceed 10.
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.

Problem URL

---

Solution

给row 和 col，给一个String数组，问这个数组能在这个显示器上show 出几遍。

Use dynamic programming to solve this problem.
dp[index] means if the row start at index then the start of next row is dp[index].
dp[index] can be larger than the length of the sentence, in this case, one row can span multiple sentences.

Code

class Solution {
    public int wordsTyping(String[] sentence, int rows, int cols) {
        int n = sentence.length;
        int[] dp = new int[n];
        int prev = 0, len = 0;
        for (int i = 0; i < n; i++){
            //when this row is full, remove previous word and space
            if (i != 0 && len > 0){
                len -= sentence[i - 1].length() + 1;
            }
            //calculate the length of each line and get next line index;
            //to avoid array out of bound, using %
            while (len + sentence[prev % n].length() <= cols){
                len += sentence[prev % n].length() + 1;
                prev++;
            }
            //it is if we start at ith word, next row we start at dp[i] word.
            dp[i] = prev;
        }
        int count = 0;
        for (int i = 0, k = 0; i < rows; i++){
            // count how many words one row has and move to start of next row.
            count += dp[k] - k;
            k = dp[k] % n;
        }
        return count / n;
    }
}

Time Complexity: O(n)
Space Complexity: O(n)

---

Review

Another approach is find the start position

public class Solution {
    public int wordsTyping(String[] sentence, int rows, int cols) {
        String s = String.join(" ", sentence) + " ";
        int start = 0, l = s.length();
        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 / s.length();
    }
}