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 maxWidthcharacters.

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 extraspace 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                  "
]

源码：

一定把情况考虑清楚。几个特殊情况：

到了最后一行，每个插入一个空格，最后一个单词把剩余的空格用光

if(j==n){
      if(k+1==j)  tmp_space=space;
      else    tmp_space=1;
}

其他行也注意是不是到了最后一个单词，到了就用光，没到就插入

if(k+1==j)  tmp_space = space;
else{
    if(space%(j-k-1)==0)    tmp_space = space/(j-k-1);
    else    tmp_space = space/(j-k-1)+1;
}

class Solution {
public:
    vector<string> fullJustify(vector<string>& words, int maxWidth) {
        vector<string> result;
        int n = words.size(), i=0;
        while(i<n){
            int j=i, tmp_len = 0;
            while(j<n && tmp_len+words[j].size()+j-i<=maxWidth){
                tmp_len += words[j++].size();
            }
            string tmp_string;
            int space = maxWidth - tmp_len;
            for(int k=i; k<j; k++){
                tmp_string.append(words[k]);
                int tmp_space = 0;
                if(space != 0){
                    if(j==n){
                        if(k+1==j)  tmp_space=space;
                        else    tmp_space=1;
                    }
                    else{
                        if(k+1==j)  tmp_space = space;
                        else{
                            if(space%(j-k-1)==0)    tmp_space = space/(j-k-1);
                            else    tmp_space = space/(j-k-1)+1;
                        }
                    }
                }
                tmp_string.append(tmp_space, ' ');
                space -= tmp_space;
            }
            i=j;
            result.push_back(tmp_string);
        }
        return result;
    }
};