LeetCode: Text Justification

越到后面越不给力了，这题又看了答案。。

class Solution {
public:
    vector<string> fullJustify(vector<string> &words, int L) {
        vector<string> ans;
        int cur = 0;
        while (cur < words.size()) {
            int len = 0;
            int pre = cur;
            while (cur < words.size()) {
                int newlen = (len == 0? words[cur].size() : len + 1 + words[cur].size());
                if (newlen > L) break;
                else len = newlen;
                cur++;
            }
            int space = L - len;
            int avgspace = 0;
            if (cur != pre + 1 && cur != words.size()) {
                avgspace = space / (cur - pre - 1);
                space %= (cur - pre - 1);
            }
            string s;
            for (int i = pre; i < cur; ++i) {
                if (i == pre) s += words[i];
                else {
                    s += string(avgspace+1, ' ');
                    if (space && cur != words.size()) {
                        s += ' ';
                        space--;
                    }
                    s += words[i];
                }
            }
            s += string(space, ' ');
            ans.push_back(s);
        }
        return ans;
    }
};

 C#

public class Solution {
    public List<string> FullJustify(string[] words, int maxWidth) {
        List<string> ans = new List<string>();
        int cur = 0;
        while (cur < words.Length) {
            int len = 0;
            int pre = cur;
            while (cur < words.Length) {
                int newLen = (len == 0? words[cur].Length : len+1+words[cur].Length);
                if (newLen > maxWidth) break;
                else len = newLen;
                cur++;
            }
            int space = maxWidth - len;
            int avgSpace = 0;
            if (cur != pre + 1 && cur != words.Length) {
                avgSpace = space / (cur - pre - 1);
                space %= (cur - pre - 1);
            }
            string s = "";
            for (int i = pre; i < cur; i++) {
                if (i == pre) s += words[i];
                else {
                    s += new string(' ', avgSpace+1);
                    if (space != 0 && cur != words.Length) {
                        s += ' ';
                        space--;
                    }
                    s += words[i];
                }
            }
            s += new string(' ', space);
            ans.Add(s);
        }
        return ans;
    }
}