leetcode 68 :Text Justification

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

class Solution {
public:
    vector
   
   
    
     fullJustify(vector
    
    
     
     & words, int maxWidth) {
        int len=0;//现在的长度
        int begin=0; //开始的单词位置
        vector
     
     
      
       ret;
        for(int i=0;i
      
      
       
       maxWidth){ // i-begin 是最少的单词数间空格数目
                ret.push_back(connetString(words,begin,i-1,len,maxWidth,false)); //只到了i-1 ，永远到不了最后一个
                len=0;
                begin=i;
            }
            len+=words[i].size();//这里过后i++ 可能就退出循环了，到了最后了，所以无论有没有进去if，最后还有单词没处理
        }
        ret.push_back(connetString(words, begin, words.size() - 1, len, maxWidth, true));//最后一行
        return ret;
    }
private: // 【start,end】 单词起止位置，单词总长度，要求长度，是否最后一行
    string connetString(vector
       
       
         & words,int start,int end,int len,int maxWidth,bool isLast){ string str; int n=end-start; for(int i=start;i<=end;i++){ str.append(words[i]); addSpace(str,i-start,n,maxWidth-len,isLast); } if (str.size() < maxWidth) str.append(maxWidth - str.size(), ' ');//!!!!! 最后一行末尾都是空格 return str; } //第i个空位，一共n个空位，要有lenSpace个空格 void addSpace(string &str,int i,int n,int lenSpace,bool isLast){ if (n < 1 || i > n - 1) return; //!!!!!!!!!!! n=0不用空格，只有 n个空位，最后一个单词后面不用空格 if(isLast) str.append( 1 ,' ' ); else{ str.append( lenSpace/n ,' ' ); if( i < lenSpace%n ){ str.append( 1 ,' ' ); //多的lenSpace%n个空格 ，先添加到左边前i个位置 } } } };