zoukankan      html  css  js  c++  java
  • 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 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.  "
    ]
    class Solution {
    public:
        vector<string> fullJustify(vector<string> &words, int maxWidth) {
            vector<string> ret;
            int nums = words.size();
            vector<int> v (nums, 0);
            for (int i = 0; i < nums; i++) {
                v[i] = words[i].length();
            }
    
            int sum = 0;
            int start = 0;
            int nwords = 0;
            string s;
    
            int i = 0;
            for (; i < nums; i++) {
                sum += v[i];
                nwords++;
    
                if (sum + nwords - 1 > maxWidth) {
                    s = "";
                    nwords--;
                    sum -= v[i];
                    if (nwords == 1) {
                        int t = maxWidth - sum;
                        s = words[start];
                        while (t--)
                            s.push_back(' ');
                    } else {
                        int a = (maxWidth-sum) / (nwords - 1);
                        int b = (maxWidth-sum) % (nwords - 1);
                        for (int j = 0; j < nwords; j++) {
                            s += words[start + j];
                            int t = a;
                            while (t-- && j != (nwords -1)) {
                                s.push_back(' ');
                            }
                            if (b > 0) {
                                s.push_back(' ');
                                b--;
                            }
                        }
                    }
                    start = start + nwords;
                    i--;
                    sum = 0;
                    nwords = 0;
                    ret.push_back(s);
                }
            }
            s = "";
            nwords = nums - start;
            for(int i=0;i<nwords;i++){
                s += words[start+i];
                if(i!= (nwords -1)){
                    s.push_back(' ');
                }
            }
            int t = maxWidth -sum - nwords + 1;
            while(t--){
                s.push_back(' ');
            }
            ret.push_back(s);
            return ret;
        }
    };
  • 相关阅读:
    反射机制(java)
    浅拷贝和深拷贝(java)
    注解(annotation)
    Oracle函数使用
    安装scikit-learn
    connection String加密
    [阿里移动推荐算法]比赛_快速入门_4_19_update_仅供参考,思维不要受局限
    阿里大数据竞赛非官方指南第三弹-- LR入门
    文本特征提取方法研究
    [新浪微博互动预测大赛]来自内部赛冠军的问候,教你破40啦!
  • 原文地址:https://www.cnblogs.com/wxquare/p/5870247.html
Copyright © 2011-2022 走看看