68. Text Justification

题目

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 extra space 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 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.

我的想法

class Solution {
    public List<String> fullJustify(String[] words, int maxWidth) {
        List<String> list = new LinkedList<>();
        int i = 0;

        while(i < words.length){
            StringBuilder str = new StringBuilder();
            int[] count = new int[50];
            int index = 0;

            while(str.length() + words[i].length() <= maxWidth){
                str.append(words[i]);
                i++;
                count[index] = str.length();
                index++;
                str.append(" ");
                if(i >= words.length) break;
            }
            if(i < words.length){
                str.deleteCharAt(str.length()-1);
                int loop = 0;
                while(str.length() != maxWidth){
                    if(loop >= index-1) loop = 0;
                    count[loop] += loop;
                    str.insert(count[loop]," ");
                    loop++;
                }
            }
            else{
                str.deleteCharAt(str.length()-1);
                while(str.length() != maxWidth) str.append(" ");
            }

            list.add(str.toString());
        }

        return list;
    }
}

解答

class Solution {
    public List<String> fullJustify(String[] words, int maxWidth) {
        int left = 0; List<String> result = new ArrayList<>();
        
        while (left < words.length) {
            int right = findRight(left, words, maxWidth);
            result.add(justify(left, right, words, maxWidth));
            left = right + 1;
        }
        
        return result;
    }
    
    private int findRight(int left, String[] words, int maxWidth) {
        int right = left;
        int sum = words[right++].length();
        
        while (right < words.length && (sum + 1 + words[right].length()) <= maxWidth)
            sum += 1 + words[right++].length();
            
        return right - 1;
    }
    
    private String justify(int left, int right, String[] words, int maxWidth) {
        if (right - left == 0) return padResult(words[left], maxWidth);
        
        boolean isLastLine = right == words.length - 1;
        int numSpaces = right - left;
        int totalSpace = maxWidth - wordsLength(left, right, words);
        
        String space = isLastLine ? " " : blank(totalSpace / numSpaces);
        int remainder = isLastLine ? 0 : totalSpace % numSpaces;
        
        StringBuilder result = new StringBuilder();
        for (int i = left; i <= right; i++)
            result.append(words[i])
                .append(space)
                .append(remainder-- > 0 ? " " : "");
        
        return padResult(result.toString().trim(), maxWidth);
    }
    
    private int wordsLength(int left, int right, String[] words) {
        int wordsLength = 0;
        for (int i = left; i <= right; i++) wordsLength += words[i].length();
        return wordsLength;
    }
    
    private String padResult(String result, int maxWidth) {
        return result + blank(maxWidth - result.length());
    }
    
    private String blank(int length) {
        return new String(new char[length]).replace('\0', ' ');
    }
}
import PySimpleGUI as sg layout1 = [ [sg.T("请输入挡土墙参数",text_color="red",size=30,font=10,justification="center",pad=(10))], [sg.Text('内斜坡高度(m)',size=30),sg.InputText(size=5,key="a")],[sg.Text('挡土墙顶部到墙趾高度(m)',size=30), sg.InputText(size=5,key="b")], [sg.Text('顶面荷载边缘距离内边坡的水平距离(m)',size=30), sg.InputText(size=5,key="c")],[sg.Text('内边坡宽度(m)',size=30), sg.InputText(size=5,key="d")], [sg.Text('列车荷载分布宽度(m)',size=30), sg.InputText(size=5,key="e")],[sg.Text('墙背倾角(°)',size=30), sg.InputText(size=5,key="f")], [sg.Text('墙底倾斜角度(°)',size=30), sg.InputText(size=5,key="g")],[sg.Text('墙背与土体摩擦角(°)',size=30), sg.InputText(size=5,key="h")], [sg.Text('挡土墙底部水平宽度(m)',size=30), sg.InputText(size=5,key="i")],[sg.Text('挡土墙重度(γ/m³)',size=30), sg.InputText(size=5,key="j")], [sg.Text('基底摩擦系数设计值',size=30),sg.InputText(size=5,key="k")] ] layout2=[ [sg.T('请输入随机变量统计特征',text_color="red",font=10,justification="center",size=30,pad=(10,10))], [sg.Text('土体重度平均值',size=30),sg.InputText(size=5)],[sg.Text('土体重度标准差',size=30),sg.InputText(size=5)],[sg.Text('土体内摩擦角平均值',size=30),sg.InputText(size=5)], [sg.Text('土体内摩擦角标准差',size=30),sg.InputText(size=5)],[sg.Text('列车荷载等效土柱高度平均值',size=30),sg.InputText(size=5)],[sg.Text('列车荷载等效土柱高度标准差',size=30),sg.InputText(size=5)] ] layout3=[[sg.T("结果分析",text_color="red",font=10)], [sg.Output(size=(80,15),key="jieguo")], [sg.Button('计算'), sg.Button('关闭')] ] layout=[ [sg.Column(layout1),sg.Column(layout2)], [layout3] ] # 创造窗口 window = sg.Window('Window Title', layout,finalize=True) while True: event, values = window.read() if event == "计算" : a=values["a"] b=values["b"] appl=a/b print('-----------------失效概率抽样计算结果-------------') print("失效概率:",appl) if event == "关闭": break window.close()
07-17
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值