【LeetCode】68. Text Justification

题目：

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

 

描述：

给出一组单词和一个数字n，将单词排版成每行最多n个字符的格式，其中要求：

单词之间的距离至少为1，而且应当尽可能远，也尽可能平均，如果距离无法平均分，那么左侧距离应比右侧距离大，

如果某行只有一个单词，则左侧对齐，

最后一行的单词，左对齐

 

分析：

没什么技巧，就是计算和模拟整个过程

 

样例：

["This", "is", "an", "example", "of", "text", "justification."]
14
["This", "is", "an", "example", "of", "text", "justification."]
16
["This", "is", "an", "example", "of", "text", "justification."]
20
["What","must","be","acknowledgment","shall","be"]
16
["Science","is","what","we","understand","well","enough","to","explain","to","a","computer.","Art","is","everything","else","we","do"]
20
["What","must","be","acknowledgment","shall","be"]
100

 

代码：（时间复杂度O（n），空间复杂度O（N），N是所有单词长度之和）

class Solution {
public:
	vector<string> fullJustify(vector<string>& words, int maxWidth) {
		int len = words.size(), index = 0;
		vector<string> result;
		while (index < len) {
			int num = maxNumber(words, maxWidth, index);
			string row = justified(words, maxWidth, index, num);
			result.push_back(row);
			index += num;
		}
		return result;
	}
	int maxNumber(vector<string>& words, int maxWidth, int index) {
		int result = 1, current = words[index].size();
		for (int i = index + 1; i < words.size(); ++ i) {
			int len = words[i].size();
			if (current + len + 1 > maxWidth) {
				break;
			}
			current += len + 1;
			++ result;
		}
		return result;
	}
	string justified(vector<string>& words, int maxWidth, int index, int num) {
		string result;
		int wordLen = 0;
		for (int i = 0; i < num; ++ i) {//统计有效单词的数量
			wordLen += words[i + index].size();
		}
		
		int spaceNum = maxWidth - wordLen;
		for (int i = 0; i < num; ++ i) {
			result += words[i + index];
			
			if (result.size() < maxWidth) {
				int evenSpaceNum = num == 1 ? spaceNum : spaceNum / (num - 1);
				if (index + num == words.size()) {//最后一行要特殊处理
					evenSpaceNum = 1;
				} else if (num > 1 && i < spaceNum % (num - 1 ) ) {
					++ evenSpaceNum;
				}
				for (int j = 0; j < evenSpaceNum; ++ j) {
					result.push_back(' ');
				}
			}
		}
		while (result.size() < maxWidth) {
			result.push_back(' ');
		}
		return result;
	}
};