leetcode-1592(简单) 重新排列单词间的空格

https://leetcode.cn/problems/rearrange-spaces-between-words/在这里插入图片描述

class Solution {



    public String reorderSpaces(String text) {
         //识别出空格和单词的数量
        //"  this  is  a  sentence "
         int spaceNum = 0;

        //单词list
        List<String> strList = new ArrayList<>();
        //每个单词
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = 0, len = text.length(); i < len; i++) {
            char oneChar = text.charAt(i);
              if (oneChar == ' ') {
                //遇到空格
                     stringBuilder = getStringBuilder(strList, stringBuilder);
                //没存过
                spaceNum++;
            } else {
                //不是空格,直接加起来
                stringBuilder.append(oneChar);
            }
        }

        if (stringBuilder.length() > 0) {
            strList.add(stringBuilder.toString());
        }

        //计算每个字符间要放多少个空格
        // 空格/(单词-1)

        //间隔空格数
        int splictNum;
        //末尾空格数
        int endNum;
        if (strList.size() == 1) {
            splictNum = 0;
            endNum = spaceNum;
        } else {
            //间隔空格数
            splictNum = spaceNum / (strList.size() - 1);
            //末尾空格数
            endNum = spaceNum % (strList.size() - 1);
        }

       StringBuilder stringBuilder1 = new StringBuilder();
        for (int i = 0, len = strList.size(); i < len; i++) {
            stringBuilder1.append(strList.get(i));
            if (i == len - 1) {
                break;
            }
             extracted(splictNum, stringBuilder1);
        }

        extracted(endNum, stringBuilder1);

        return stringBuilder1.toString();
    }

        private void extracted(int splictNum, StringBuilder stringBuilder1) {
        for (int j = 0; j < splictNum; j++) {
            stringBuilder1.append(" ");
        }
    }


      private StringBuilder getStringBuilder(List<String> strList, StringBuilder stringBuilder) {
        //遇到空格
        if (stringBuilder.length() > 0) {
            //存过
            strList.add(stringBuilder.toString());
            stringBuilder = new StringBuilder();
        }
        return stringBuilder;
    }

  
  

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值