題目
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.
You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces ' '
when necessary so that each line has exactly L characters.
Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line do not divide evenly between words, the empty slots on the left will be assigned more spaces than the slots on the right.
For the last line of text, it should be left justified and no extra space is inserted between words.
For example,words: ["This", "is", "an", "example", "of", "text", "justification."]
L: 16
.
Return the formatted lines as:
[
"This is an",
"example of text",
"justification. "
]
Note: Each word is guaranteed not to exceed L in length.
click to show corner cases.
Corner Cases:
A line other than the last line might contain only one word. What should you do in this case?In this case, that line should be left-justified.
分析
先確定能放入幾個(gè)詞
然后確定每個(gè)間隔處放幾個(gè)空格以及前幾個(gè)空格要多加空格
然后進(jìn)行操作埃难，要注意處理只能放一個(gè)詞的情況以及最后一行的情況。
實(shí)現(xiàn)
class Solution {
public:
vector<string> fullJustify(vector<string>& words, int maxWidth) {
vector<string> ans;
int start=0, i, length, n;
while(start<words.size()){
i=start+1; length=words[start].size(); n=1;
while(i<words.size() && length+words[i].size()+1<=maxWidth){
length += words[i].size() + 1;
i++; n++;
}
string tmp(words[start]);
int nb, nbb;
if(n>1 && i<words.size()){
nb = (maxWidth - length + n - 1) / (n - 1);
nbb = (maxWidth - length + n - 1) % (n - 1);
for(int j=start+1; j<i; j++){
for(int k=0; k<nb; k++)
tmp += ' ';
if(j-start<=nbb)
tmp += ' ';
tmp += words[j];
}
}
else {
for(int j=start+1; j<i; j++){
tmp += ' ';
tmp += words[j];
}
while(tmp.size()<maxWidth) tmp += ' ';
}
ans.push_back(tmp);
start = i;
}
return ans;
}
};
思考
無
