LeetCode OJ——Text Justification

http://oj.leetcode.com/problems/text-justification/

编译代码要看warnings!它提供了可能出问题的情况，比如类型转换上unsigned int < int的比较，要用计算机的思维。这道题终究还是没有AC，差不多就这样吧。

要养成好的代码习惯，可以一边写代码，一边debug。注意变量命名之类的，常规问题。

Good good study!

#include <iostream>
#include <vector>
#include <string>
using namespace std;

class Solution {
public:
    vector< string> fullJustify(vector <string> & words, int L) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int alreadylen = 0;
        int beginindex = 0,endindex = 0;
        int averagespace = 0,firstspace = 0;
        vector<string > result;

        string onepiece("");
        for(unsigned int index = 0;index<words.size();index++)
        {
            beginindex  = endindex = index;
            alreadylen = 0;

            while((index<words.size())&&( static_cast<int>(words[index].size()) <= (L-alreadylen)))
            {
                int wordsindexsize = words[index].size();
                alreadylen += words[index].size()+1;
                index++;
            }

            endindex = index;

            if(beginindex == endindex-1)
            {
                onepiece.clear();
                onepiece = words[beginindex];
                if(L -words[beginindex].size()>0)
                    onepiece.append( L-words[beginindex].size(),' ');                                                           
            }
            else if(index != words.size()+1 && index!=words.size())
            {
                onepiece.clear();
                averagespace = (L-alreadylen+1)/(endindex-beginindex-1);
                firstspace = averagespace + (L -alreadylen+1)%(endindex-beginindex-1);

                for(int tt = beginindex;tt<endindex;tt++)
                {
                    onepiece +=words[tt];
                    if(tt==beginindex)
                        onepiece.append(firstspace+1,' ' );
                    else if(tt!= endindex -1)
                        onepiece.append(averagespace+1,' ' );
                }
            }
            else
            {
                onepiece.clear();
                int alreadylength = 0;
                for(int tt = beginindex;tt<endindex;tt++)
                {
                    
                    onepiece += words[tt];
                    alreadylength += words[tt].size();
                    if(tt!=words.size()-1)
                    {
                        onepiece.append(1,' ' );
                        alreadylength++;
                    }
                    else
                        onepiece.append(L-alreadylength,' ' );

                }

            }
            index--;
            result.push_back(onepiece);
        }
        return result; 
    }
    };


    int main()
    {
        Solution *mySolution = new Solution();

        //words: [This, "is", "an", "example", "of", "text", "justification."]
        //L: 16.
        vector<string > words;
 
        /*words.push_back( "this");
        words.push_back( "is");
        words.push_back( "an");
        words.push_back( "example");
        words.push_back( "of"); 
        words.push_back( "text"); 
        words.push_back( "justification."); */
        words.push_back( "what");
        words.push_back( "must");
        words.push_back( "be");
        words.push_back( "shall");
        words.push_back( "be."); 
        vector<string > output;
        output = mySolution->fullJustify(words,12);
        for(unsigned int i = 0;i<output.size();i++)
            cout<<output[i]<<endl;

        return 0;
    }