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.
一刷
題解：我們首先構(gòu)造一個(gè)string, 用空格把word分隔開，并在尾部添加空格, 形成字符串s。(循環(huán)數(shù)組，所以真實(shí)的位置為start%s.length())
然后我們用start來表示下一行的起始位置。如果start指向的位置為空格，那么start--, 因?yàn)榭梢院雎赃@個(gè)空格。
如果不為空格，那么我們至少要保證s[start-1]為空格，否則我們split了一個(gè)單詞。
Example:
以下為start所指的位置
"abc de f abc de f abc de f ..."
^ ^ ^ ^ ^
0 7 13 18 25
output:
"abc de"
"f abc "
"de f "
"abc de"
class Solution {
public int wordsTyping(String[] sentence, int rows, int cols) {
String s = String.join(" ", sentence) + " ";
int start = 0, len = s.length();
for(int i=0; i<rows; i++){
start += cols;
if(s.charAt(start%len) == ' '){
start++;//start with space, can eliminate
}else{
while(start>0 &&s.charAt((start-1)%len)!=' '){
start--;
}
}
}
return start/len;
}
}
