LeetCode #418 - 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.

class Solution {
public:
    int wordsTyping(vector<string>& sentence, int rows, int cols) {
        int n=sentence.size();
        int total_len=0;
        for(string word:sentence) total_len+=word.size()+1;
        int count=0;
        int row=0;
        int i=0;
        int remainNum=cols; //表示当前行还剩多少个字符
        while(row<rows)
        {
            if(remainNum>=sentence[i].size())
            {
                remainNum-=sentence[i].size(); 
                if(remainNum>0) remainNum--; //如果还有字符剩余，就要添加单词后面的空格
                if(i==n-1) //说明要重新遍历一次sentence
                { // 如果存在cols很大的情况，直接可以将整个sentence的words都放进来
                    i=0;
                    count++;
                    count+=remainNum/total_len; // 可以放进的sentence数
                    remainNum%=total_len;
                }
                else i++;
            }
            else //开始新的一行
            {
                remainNum=cols;
                row++;
            }
        }
        return count;
    }
};