Text Justification

最新推荐文章于 2021-09-09 01:27:41 发布

千寻221

最新推荐文章于 2021-09-09 01:27:41 发布

阅读量590

点赞数

分类专栏： LeetCode 文章标签： Java LeetCode String 数组

本文链接：https://blog.csdn.net/u010378705/article/details/35557791

版权

LeetCode 专栏收录该内容

150 篇文章 0 订阅

订阅专栏

题目

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.

方法

处理好空格的个数以及边界条件。

    public List<String> fullJustify(String[] words, int L) {
        List<String> list = new ArrayList<String>();
        if (words == null || words.length == 0) {
            return list;
        }
        int len = words.length;
        int left = 0;
        int curSum = words[0].length();
        int right = 0;
        for (int i = 1; i < len; i++) {
            if (curSum + 1 + words[i].length() <= L) {
                curSum = curSum + 1 + words[i].length();
                right = i;
            } else {
                StringBuilder builder = new StringBuilder();
                int remain = L - curSum;
                if (right == left) {
                    builder.append(words[left]);
                    for (int k = 0; k < remain; k++) {
                        builder.append(' ');
                    }
                    list.add(builder.toString());
                } else {
                    int p = remain / (right - left);
                    int q = remain % (right - left);
                    for (int k = left; k <= right; k++) {
                        if (k == left) {
                            builder.append(words[k]);
                        } else {
                            if (q > 0) {
                                builder.append(' ');
                                q--;
                            }
                            for (int j = 0; j <= p; j++) {
                                builder.append(' ');
                            }
                            builder.append(words[k]);
                        }
                    }
                    list.add(builder.toString());
                }
                left = i;
                right = i;
                curSum = words[i].length();
            }
        }
        StringBuilder builder = new StringBuilder();
        int remain = L - curSum;
        for (int k = left; k <= right; k++) {
            if (k == left) {
                builder.append(words[k]);
            } else {
                builder.append(' ');
                builder.append(words[k]);
            }
        }
        for (int i = 0; i < remain; i++) {
            builder.append(' ');
        }
        list.add(builder.toString());
        return list;
    }