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

    c++代码:

    class Solution {
    private:
        string handle_normal(vector<string> &word, int L, int wordL) {
            string answer;
            if (word.size() == 1) {
        		answer += word[0];
        		for (int i = 0; i < L - wordL; i++) {
        			answer += " ";
        		}
        		return answer;
        	}
            int d = (L - wordL) / (word.size() - 1);
            int r = (L - wordL) % (word.size() - 1);
            answer = word[0];
            for (int i = 1; i < word.size(); i++) {
                for (int j = 0; j < d; j++) {
                    answer += " ";
                }
                if (r > 0) {
                    answer += " ";
                    r--;
                }
                answer += word[i];
            }
            return answer;
        }
        
        string handle_end(vector<string> &word, int L, int count) {
            string answer;
            answer = word[0];
            for (int i = 1; i < word.size(); i++) {
                answer += " " + word[i];
            }
            for (int i = 0; i < L - count; i++) {
                answer += " ";
            }
            return answer;
        }
        
    public:
        vector<string> fullJustify(vector<string> &words, int L) {
            // Start typing your C/C++ solution below
            // DO NOT write int main() function
            vector<string> ans;
            vector<string> selWord;
            int count = -1, wordL = 0;
            for (vector<string>::iterator iter = words.begin(); iter != words.end(); iter++) {
                if (count + iter->length() + 1 > L) {
                    ans.push_back(handle_normal(selWord, L, wordL));
                    selWord.clear();
                    count = -1;
                    wordL = 0;
                }
                count += 1 + iter->length();
                wordL += iter->length();
                selWord.push_back(*iter);
            }
            ans.push_back(handle_end(selWord, L, count));
            return ans;
        }
    };
    

      

  • 相关阅读:
    SQL Server 2016,2014 “无法找到数据库引擎启动句柄”
    SCCM Collection 集合获取计算机最后启动时间
    在Office 365 添加就地保留用户邮箱
    SQL Server数据库log shipping 灾备(Part2 )
    SQL Server数据库log shipping 灾备(Part1 )
    领域驱动设计案例之实现业务3
    领域驱动设计案例之业务实现2
    领域驱动设计案例之业务实现1
    领域驱动设计案例之仓储顶层实现
    领域驱动设计案例之领域层实体与聚合根实现
  • 原文地址:https://www.cnblogs.com/zhutianpeng/p/4264947.html
Copyright © 2011-2022 走看看