zoukankan      html  css  js  c++  java
  • leetcode@ [68] Text Justification (String Manipulation)

    https://leetcode.com/problems/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.  "
    ]

    Note: Each word is guaranteed not to exceed L in length.

    Corner Cases:

    A line other than the last line might contain only one word. What should you do in this case?
    In this case, that line should be left-justified.

    class Solution {
    public:
        string func(int len) {
            string res = "";
            while(len--) res += " ";
            return res;
        }
        vector<string> fullJustify(vector<string>& words, int maxWidth) {
            vector<string> res; res.clear();
            
            //Assuming that the length of longest string in the words must be shorter or equal to maxWidth.
            int len = 0;
            int i = 0, size = words.size();
            while(i < size) {
                if(len + words[i].length() == maxWidth) {
                    len = 0;
                    res.push_back(words[i]);
                    ++i;
                }
                else if(len + words[i].length() < maxWidth) {
                    len = len + words[i].length();
                    int left = i;
                    while(i+1 < words.size() && len+1+words[i+1].length() <= maxWidth) {
                        len += 1+words[i+1].length();
                        ++i;
                    }
                    len = 0;
                    int right = i, tot_len = 0, tot_empty_len, each_empty_len, remain_empty_len;
                    
                    for(int k = left;k <= right; ++k) tot_len += words[k].length();
                    
                    tot_empty_len = maxWidth - tot_len;
                    each_empty_len = (left == right)? tot_empty_len: tot_empty_len / (right-left);
                    remain_empty_len = tot_empty_len - each_empty_len * (right-left);
                    
                    string r = "";
                    if(left == right) {
                        string tmp = func(tot_empty_len);
                        r += words[left] + tmp;
                        res.push_back(r);
                    }
                    else {
                        string tmp;
                        if(right <= size - 2) {
                            for(int k = left; k <= right - 1; ++k) {
                                if(remain_empty_len > 0) {
                                    tmp = func(each_empty_len+1);
                                    remain_empty_len--;
                                }
                                else tmp = func(each_empty_len);
                                r += words[k] + tmp;
                            }
                            r += words[right];
                            res.push_back(r);    
                        }
                        else {
                            for(int k = left; k <= right - 1; ++k) {
                                tmp = func(1);
                                r += words[k] + tmp;
                            }
                            r += words[right];
                            if(r.length() < maxWidth) r += func(maxWidth - r.length());
                            res.push_back(r);
                        }
                    }
                    ++i;
                }
            }// end while
            
            return res;
        }
    };
    leetcode 68: Text Justification
  • 相关阅读:
    poj 2352 Stars(线段树)
    poj 2029 Get Many Persimmon Trees
    .Net remoting 的解答,以及跟WebService的区别
    关于Xcode4.2中的release“不能”使用的理解
    委托的学习日志
    钩子是啥?以及用来说啥,是不是可以用来做即时通讯?
    C#后台程序与HTML页面中JS方法互调(功能类似于Ajax中的DWR)
    接触了一下项目管理系统软件:禅道项目管理软件、Bugfree
    将string变为int 的几种方法方法比较
    Hashtable、Dictionary、SortedDictionary、SortedList的比较应用
  • 原文地址:https://www.cnblogs.com/fu11211129/p/5016959.html
Copyright © 2011-2022 走看看