[leetcode]Text Justification

Text Justification

Difficulty:Hard

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.

题目意思就是显示英文时，每一行都要放尽量多的词，并且每个词之间都要至少有一个空格，如果空格多的话，就把多余的平分空格放在尽量靠左的空格处，最后一行时不应该有多余的空格。

我的做法就是对于每一行，先选择要放那几个词，然后根据选的词填上空格。实际结果时间复杂度并不是很理想。

 vector<string> fullJustify(vector<string>& words, int maxWidth) {

	 vector<string> result;

	 int size = words.size();
	 for (int k = 0; k < size; ++k){

		 //***************选词***************
		 vector<string> vec_tmp;
		 int wordLength = 0;
		 bool isLastLine = false;

		 string strTmp = words[k];
		 wordLength += strTmp.size();
		 vec_tmp.push_back(strTmp);
		

		 while(wordLength < maxWidth){
			 ++k;
			 if (k < words.size()){
				 strTmp = words[k];

				 if ((wordLength + strTmp.size()) < maxWidth && (maxWidth - (wordLength + strTmp.size())) > vec_tmp.size() - 1){
					 vec_tmp.push_back(strTmp);
					 wordLength += strTmp.size();
				 }
				 else{
					 --k;
					 break;
				 }
			 }
			 else{
				 --k;
				 isLastLine = true;//判断是否是最后一行
				 break;
			 }
		 }
		 //**********************************

		 //***************填空***************
		 if (vec_tmp.size() > 1){
			 int quotient = (maxWidth - wordLength) / (vec_tmp.size() - 1);
			 int remain = (maxWidth - wordLength) % (vec_tmp.size() - 1);

			 string tmpResult = "";
			 for (int i = 0; i < vec_tmp.size(); ++i){
				 tmpResult.append(vec_tmp[i]);

				 if (i < vec_tmp.size() - 1){//判断是否还要加空格
					 int space = quotient;

					 if (!isLastLine){
						 if (i < remain)
							 ++space;
					 }
					 else{
						 space = 1;
					 }

					 for (int j = 0; j < space; ++j){//加空格
						 tmpResult.append(" ");
					 }
				 }

			 }
			 if (tmpResult.size() < maxWidth){//最后一行后面添加空格
				 int space = maxWidth - tmpResult.size();
				 for (int i = 0; i < space; ++i)
					 tmpResult.append(" ");
			 }

			 result.push_back(tmpResult);
		 }
		 else{
			 string tmpResult = vec_tmp[0];
			 for (int i = 0; i < maxWidth - wordLength; ++i)
				 tmpResult.append(" ");

			 result.push_back(tmpResult);
		 }
		 //**********************************
	 }

	 return result;
 }