Leetcode_68_文本左右对齐_模拟

import java.util.ArrayList;
import java.util.List;

class Solution {
    public List<String> fullJustify(String[] words, int maxWidth) {
        List<String> ans = new ArrayList<>();
        int len = words.length;
        int now = words[0].length();
        int st = 0;
        for (int i = 1; i < len; i++) {
            // 预留一个空格位
            int add = now + words[i].length() + 1;
            if (add <= maxWidth) {
                now = add;
            } else {
                if (i - st == 1) {
                    ans.add(appendOne(words, st, maxWidth));
                } else {
                    ans.add(merge(words, st, i, maxWidth, now));
                }
                now = words[i].length();
                st = i;
            }
        }
        if (now != 0) {
            ans.add(appendFinal(words, st, maxWidth));
        }
        return ans;
    }

    String merge(String[] words, int st, int ed, int maxWidth, int all) {
        // 加上之前预留的空格
        int average = (maxWidth - all) / (ed - st - 1) + 1;
        int mod = (maxWidth - all) % (ed - st - 1);
        StringBuilder blank = new StringBuilder();
        for (int i = 0; i < average; i++) {
            blank.append(" ");
        }
        StringBuilder ans = new StringBuilder(words[st]);
        for (int i = st + 1; i < ed; i++) {
            ans.append(blank);
            if (mod > 0) {
                mod--;
                ans.append(" ");
            }
            ans.append(words[i]);
        }
        return ans.toString();
    }

    String appendFinal(String[] words, int st, int maxWidth) {
        StringBuilder ans = new StringBuilder(words[st]);
        for (int i = st + 1; i < words.length; i++) {
            ans.append(" ").append(words[i]);
        }
        while (ans.length() != maxWidth) {
            ans.append(" ");
        }
        return ans.toString();
    }
    
    String appendOne(String[] words, int st, int maxWidth) {
        StringBuilder ans = new StringBuilder(words[st]);
        while (ans.length() != maxWidth) {
            ans.append(" ");
        }
        return ans.toString();
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值