zoukankan      html  css  js  c++  java
  • leetcode--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 exactlyL 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."]
    L16.

    Return the formatted lines as:

    [
       "This    is    an",
       "example  of text",
       "justification.  "
    ]
    

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

    click to show corner cases.

    public class Solution {
        public ArrayList<String> fullJustify(String[] words, int L) {
          ArrayList<String> result = new ArrayList<String>();
            StringBuffer stb = new StringBuffer();
            if(L > 0){
                for(String s : words){
                    if(s.length() + stb.length() > L){
                        String st = justification(stb, L);
                        result.add(st);
                        stb = new StringBuffer();
                    }
                    stb.append(s+" ");            
                }
    
                if(stb.length() != 0){
                    if(stb.charAt(stb.length() - 1) == ' ')
                        stb.deleteCharAt(stb.length() - 1);
                    if(L - stb.length() > 0)
                        stb.append(blankCharArray(L - stb.length()));
                    result.add(stb.toString());
                }
            }
            else
                result.add("");
            return result;    
        }
    
        public String justification(StringBuffer stb, int length){
            //String result = null;
            int len = stb.length();
            if(stb.charAt(len - 1) == ' ')
                stb.deleteCharAt(len - 1);
            int blanks = 0;    
            for(int i = 0; i < stb.length(); ++i){
                if(stb.charAt(i) == ' ')
                    ++blanks;        
            }
            int len2 = stb.length();
            int insertBlanks = length - len2;
            if(blanks > 0 && insertBlanks > 0){
                for(int j = len2 -1 ; j > 0; --j){
                    if(stb.charAt(j - 1) != ' ' && stb.charAt(j) == ' '){
                        stb.insert(j, blankCharArray(insertBlanks / blanks));
                        insertBlanks -= insertBlanks / blanks;
                        --blanks;
                    }        
                }    
            }
            else if(blanks == 0 && insertBlanks > 0)
                stb.append(blankCharArray(insertBlanks));
            return stb.toString();
        }
    
        public char[] blankCharArray(int length){
            char[] inserted = new char[length];
            for(int i = 0; i < length; ++i){
                inserted[i] = ' ';
            }
            return inserted;    
        }
    }
    

     

  • 相关阅读:
    MISC | ctfshow 31
    010editor 没有分块高亮显示了
    BUUCTF | [网鼎杯 2020 朱雀组]phpweb
    python2与python3共存后,如何使用
    kali2020 装不上docker
    php代码审计整理
    [MRCTF2020]Ezpop
    kali没有tcptraceroute如何安装
    [BUUCTF] 真的很杂
    【弱网测试】备份弱网测试相关数据
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3612798.html
Copyright © 2011-2022 走看看