华为OD题目：去除多余空格

华为OD题目：去除多余空格

package com.darling.boot.order.odt.odt9;

import java.util.*;

/**
 * 去除多余空格
 *
 *
 * Life is painting a  picture, not doing 'a  sum'.
 * 8 15,20 26,43 45
 *
 * 解题思路:
 * 按照题目做就行了，主要是用list记录多余的空格的下标，然后在关键字里下标移动的时候，要将list倒序排列，然后比较
 *
 */
public class My {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String line = sc.nextLine();
        char[] charArray = line.toCharArray();

        String line2 = sc.nextLine();
        String[] strings = line2.split(",");
        int[][] keyArr = new int[strings.length][2];

        for (int i = 0; i < strings.length; i++) {
            String keyStr = strings[i];
            String[] split = keyStr.split(" ");
            int[] key = new int[2];
            key[0] = Integer.parseInt(split[0]);
            key[1] = Integer.parseInt(split[1]);
            keyArr[i] = key;
        }


        //前一位是否是空格
        boolean isPreBlank = false;
        //是否在引号里面
        boolean isInMask = false;
        //list 用于存放多余的空格
        List<Integer> blankList = new ArrayList<>();

        StringBuilder newLetter = new StringBuilder();



        for (int i = 0; i < charArray.length; i++) {
            char currChar = charArray[i];
            //如果当前字符是空格
            if (currChar == ' ') {
                //如果前面以为是空格 且 不在单引号内，记录此下标
                if (isPreBlank && !isInMask) {
                    blankList.add(i);
                }else {
                    //否则，就是初始空格，要放入新的newLetter里面
                    newLetter.append(currChar);
                }
                isPreBlank = true;
                continue;
            }
            //如果当前符合是单引号，因为引号是成对出现，那么对 isInMask 取反
            if (currChar == '\'') {
                isInMask = !isInMask;
                isPreBlank = false;
                newLetter.append(currChar);
                continue;
            }
            //如果不是上面两种字符，那么刷新 isPreBlank 标志位为 false
            newLetter.append(currChar);
            isPreBlank = false;

        }
        //将多余的空格下标数组倒序排列
        blankList.sort((a, b) -> b - a);
        for (int blankIndex : blankList) {
            for (int i = 0; i < keyArr.length; i++) {
                if (blankIndex < keyArr[i][0]) {
                    keyArr[i][0]--;
                    keyArr[i][1]--;
                }
            }
        }

        for (int i = 0; i < keyArr.length; i++) {
            int left = keyArr[i][0];
            int right = keyArr[i][1];
            System.out.print(" [" + left + ", " + right + "]");
        }





    }




}