zoukankan      html  css  js  c++  java
  • 68. Text Justification(js)

    68. Text Justification

    Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth 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 maxWidth 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.

    Note:

    • A word is defined as a character sequence consisting of non-space characters only.
    • Each word's length is guaranteed to be greater than 0 and not exceed maxWidth.
    • The input array words contains at least one word.

    Example 1:

    Input:
    words = ["This", "is", "an", "example", "of", "text", "justification."]
    maxWidth = 16
    Output:
    [
       "This    is    an",
       "example  of text",
       "justification.  "
    ]
    

    Example 2:

    Input:
    words = ["What","must","be","acknowledgment","shall","be"]
    maxWidth = 16
    Output:
    [
      "What   must   be",
      "acknowledgment  ",
      "shall be        "
    ]
    Explanation: Note that the last line is "shall be    " instead of "shall     be",
                 because the last line must be left-justified instead of fully-justified.
                 Note that the second line is also left-justified becase it contains only one word.
    

    Example 3:

    Input:
    words = ["Science","is","what","we","understand","well","enough","to","explain",
             "to","a","computer.","Art","is","everything","else","we","do"]
    maxWidth = 20
    Output:
    [
      "Science  is  what we",
      "understand      well",
      "enough to explain to",
      "a  computer.  Art is",
      "everything  else  we",
      "do                  "
    ]
    题意:给定一个由一连串单词项组成的字符串数组,要求对数组项进行合并使得每一行长度相同
    代码如下:
    /**
     * @param {string[]} words
     * @param {number} maxWidth
     * @return {string[]}
     */
    var fullJustify = function(words, maxWidth) {
        let res=[],i=0;
        while(i<words.length){
            let j=i,len=0;
            while(j<words.length && len+words[j].length+j-i<=maxWidth){
                len+=words[j++].length;
            }
            let out='';
            let space=maxWidth-len;
            for(let k=i;k<j;k++){
                out+=words[k];
                if(space>0){
                    let tmp;
                    if(j===words.length){
                        if(j-k===1) tmp=space;
                        else tmp=1;
                    }else{
                        if(j-k-1>0){
                            if(space%(j-k-1)===0) tmp=parseInt(space/(j-k-1));
                            else tmp=parseInt(space/(j-k-1))+1;
                        }else{
                            tmp=space;
                        }
                    }
                    for(let m=0;m<tmp;m++){
                        out+=' ';
                    }
                    space-=tmp;
                } 
    
            }
            res.push(out);
            i=j;
        }
        return res;
    };
  • 相关阅读:
    Charles网络工具
    查找最长子串的长度(不重复字符)
    KMP算法
    java并发编程实战:第十四章----构建自定义的同步工具
    java并发编程实战:第十二章---并发程序的测试
    java并发编程实战:第二章----线程安全性
    java并发编程实战:第三章----对象的共享
    java并发编程实战:第四章----对象的组合
    java并发编程实战:第五章----基础构建模块
    java并发编程实战:第六章----任务执行
  • 原文地址:https://www.cnblogs.com/xingguozhiming/p/10512954.html
Copyright © 2011-2022 走看看