[LeetCode.68]文本左右对齐

采用的是每层每层的放置    数据数设为d，空格数设为b

1.若层里面放置的d-b=1，则空格的长度都是1

21.若是末层，则前d-1个空格都设为1，最后一个（若有）设为b-d

22.若不是末层，当d-1=0时，其后的空格数（若有）设为b

                          当d-1！=0时，根据相应的算法算出各个空格数的长度

可能说的不太明确，对应代码看下：

class Solution
{
public:
	vector<string> fullJustify(vector<string>& words, int maxWidth)
	{
		if (words.empty())
			return words;
		vector<string> res;
		for (int i = 0; i<words.size();)
		{
			string str = "";
			int width = 0;
			for (int j = i; j<words.size(); ++j)
			{
				if (width != 0)
					width += 1;
				width += words[j].size();
				if (width>maxWidth)
				{
					j--;
					PrintJustify(words, str, i, j, maxWidth, 0);
					i = j + 1;
					break;
				}
				if (j == words.size()-1)
				{
					PrintJustify(words, str, i, j, maxWidth, 1);
					i = j + 1;
					break;
				}
			}
			res.push_back(str);
		}
		return res;
	}
	void PrintJustify(vector<string>& words, string& str, int i, int j, int maxWidth, bool flag)
	{
		int left = i, right = j;
		int len = 0;
		for (; left <= j; ++left)
		{
			len += words[left].size();
		}
		int _blank = maxWidth - len;
		left = i;
		if (_blank == j - i)
		{
			str += words[left];
			++left;
			for (; left <= j; ++left)
			{
				str += " ";
				str += words[left];
			}
			return;
		}
		else
		{
			vector<int> vBlank;
			if (flag)
			{
				int dis = j - i;
				while (dis--)
				{
					vBlank.push_back(1);
				}
				vBlank.push_back(_blank - j + i);
			}
			else
			{
				if (j - i)
				{
					float avg = (float)_blank / (float)(j - i);
					int _max = ceil(avg);
					int _min = floor(avg);
					int numMax = _blank - _min*(j - i);
					for (int ii = 0; ii<numMax; ++ii)
					{
						vBlank.push_back(_max);
					}
					for (int jj = numMax; jj < j - i; ++jj)
					{
						vBlank.push_back(_min);
					}
				}
				else
				{
					vBlank.push_back(_blank);
				}
			}
			int y = 0;
			left = i;
			for (; left <= j; ++left)
			{
				str += words[left];
				if (y < vBlank.size())
				{
					string sBlank(vBlank[y++], ' ');
					str += sBlank;
				}
			}
		}
	}
};