LeetCode算法系列：68. Text Justification

题目描述：
 

Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth 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 maxWidth 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.

Note:

• A word is defined as a character sequence consisting of non-space characters only.
• Each word's length is guaranteed to be greater than 0 and not exceed maxWidth.
• The input array words contains at least one word.

Example 1:

Input:
words = ["This", "is", "an", "example", "of", "text", "justification."]
maxWidth = 16
Output:
[
   "This    is    an",
   "example  of text",
   "justification.  "
]

Example 2:

Input:
words = ["What","must","be","acknowledgment","shall","be"]
maxWidth = 16
Output:
[
  "What   must   be",
  "acknowledgment  ",
  "shall be        "
]
Explanation: Note that the last line is "shall be    " instead of "shall     be",
             because the last line must be left-justified instead of fully-justified.
             Note that the second line is also left-justified becase it contains only one word.

Example 3:

Input:
words = ["Science","is","what","we","understand","well","enough","to","explain",
         "to","a","computer.","Art","is","everything","else","we","do"]
maxWidth = 20
Output:
[
  "Science  is  what we",
  "understand      well",
  "enough to explain to",
  "a  computer.  Art is",
  "everything  else  we",
  "do                  "
]

算法实现：

思路比较简单，按照题目所说一步一步即可实现

• 先找到当前行容纳的具体单词，从哪个到哪个
• 对每一行，要判断该行是最后一行？只有一个单词？普通行？
• 具体按照要求进行操作

class Solution {
public:
    vector<string> fullJustify(vector<string>& words, int maxWidth) {
        vector<string> res;
        int start = 0, end = 0, n = words.size();
        //每执行一次此循环是一行
        //对一次循环，要判断该行是最后一行？只有一个单词？普通行？
        //具体按照要求进行操作
        while(start < n){
            int wordlength = 0;
            wordlength += words[start].length();
            //找到当前行的最后一个单词索引(end - 1)，end确切的是给出下一行的第一个单词索引
            while(end < n && wordlength <= maxWidth){
                if(end == n - 1) end ++;
                else wordlength += 1 + words[++ end].length();
            }
            //最后一行的处理
            if(end == n){
                string s = "";
                for(int i = start; i < end - 1; i ++){
                    s += words[i];
                    s += ' ';
                }
                if(end - 1 >= start)s += words[end - 1];
                for(int i = wordlength; i < maxWidth; i ++)
                    s += ' ';
                res.push_back(s);
            }
            else if(end - start == 1){
                string s = words[start];
                for(int i = words[start].length(); i < maxWidth; i ++)
                    s += ' ';
                res.push_back(s);
            }
            //正常情况
            else if(end != n){
                string s = "";
                wordlength -= words[end].length() + 1;
                int suanz = (maxWidth - wordlength)/(end - start - 1) + 1;
                int suanz2 = (maxWidth - wordlength)%(end - start - 1);
                for(int i = 0; i < suanz2; i ++){
                    s += words[start + i];
                    for(int j = 0; j < suanz + 1; j ++)s += ' ';
                }
                for(int i = start + suanz2; i < end; i ++){
                    s += words[i];
                    if(i < end - 1)
                        for(int j = 0; j < suanz; j ++)
                            s += ' ';
                }
                res.push_back(s);
            }
            start = end;
        }
        return res;
    }
};