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

    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 extraspace 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                  "
    ]

    注意对最后一行的单独考虑

    class Solution {
        public List<String> fullJustify(String[] words, int maxWidth) {
            String s = "";
            List<String> ret = new ArrayList<String>();
            int curWidth = 0; //Width of current String 
            int start = 0; //start word index of current String
            int spaceCnt, totalSpace, q, r, i, j, k;
            for(i = 0; i < words.length; ){
                if(s.length()==0){
                    s += words[i];
                    curWidth += words[i].length();
                    i++;
                }
                else if(curWidth + words[i].length() + 1 > maxWidth){
                    spaceCnt = i-1-start;
                    totalSpace = maxWidth - (curWidth-spaceCnt);
                    if(spaceCnt == 0){
                        for(j = 0; j < totalSpace; j++){
                            s += ' ';
                        }
                    }
                    else{
                        q = totalSpace/spaceCnt;
                        r = totalSpace%spaceCnt;
                        for(j = 0; j < r; j++){
                            for(k = 0; k <= q; k++){ //1 more space
                                s += ' ';
                            }
                            s += words[start+1+j];
                        }
                        for(j = r; j < spaceCnt; j++){
                            for(k = 0; k < q; k++){
                                s += ' ';
                            }
                            s += words[start+1+j];
                        }
                    }
                    
                    ret.add(s);
                    
                    //initialize
                    s = "";
                    curWidth = 0;
                    start = i;
                }
                else{
                    curWidth = curWidth + words[i].length() + 1;
                    i++;
                }
            }
            
            //deal with last case
            for(i = start+1; i < words.length; i++){
                s = s + ' ' + words[i];
            }
            for(i = curWidth; i < maxWidth; i++){
                s += ' ';
            }
            ret.add(s);
            
            return ret;
        }
        
    }
  • 相关阅读:
    leetcode-38.报数
    leetcode-35.搜索插入位置
    leetcode-27.移除元素
    leetcode-26.删除重复数组中的重复项
    leetcode-20.有效的括号
    leetcode-973最接近原点的K个点
    leetcode-14最长公共前缀
    leetcode-13罗马字符转整数
    MFC俄罗斯方块
    leetcode-9.回文数(水仙花数)
  • 原文地址:https://www.cnblogs.com/qionglouyuyu/p/10911219.html
Copyright © 2011-2022 走看看