282题 Decrypt the String解压字符串

最新推荐文章于 2023-06-15 19:24:03 发布

CMYing85

最新推荐文章于 2023-06-15 19:24:03 发布

阅读量80

点赞数

分类专栏：算法文章标签：字符串算法面试

本文链接：https://blog.csdn.net/caomengying/article/details/117329857

版权

算法专栏收录该内容

232 篇文章 0 订阅

订阅专栏

本文介绍了一种名为DecryptString的解压字符串问题，通过XiaoQ的例子，展示如何使用压缩算法处理连续重复字符，如[3|ABC]，并提供了Java代码实现。解压缩过程涉及解析字符串和替换重复部分。

摘要由CSDN通过智能技术生成

Decrypt the String解压字符串

Description
Xiao Q wanted to send a mysterious string to his friend, but he found that the string was too long, so Xiao Q invented a compression algorithm to compress the repeated part of the string, for the continuous m same string S will be compressed to [m|S] (m is an integer and 1<=m<=100). For example, the string ABCABCABC will be compressed to [3|ABC].Now Xiao A receives the string sent by Xiao Q, can you help him decompress it?

public class Solution {
    /**
     * @param Message: the string xiao Q sent to xiao A.
     * @return: the string after decompress
     */
   
    public String DecompressString(String Message) {
        // write your code here
        if(Message == null || Message.length() == 0){
            return null ;
        }
        StringBuilder result = new StringBuilder() ;
        for(int i = 0 ; i < Message.length() ; i++){
            if(Message.charAt(i) != ']'){
                result.append(Message.charAt(i)) ;
            }else{
                int j = result.length() -1  ;
                while(result.charAt(j) != '|'){
                    j-- ;
                }
                 String repert = result.substring(j+1) ;
                int k = j -1 ;
                while(Character.isDigit(result.charAt(k))){
                    k-- ;
                }
                int count = Integer.parseInt(result.substring(k+1 , j)) ;
                result.setLength(k) ;
                for(int l = 0 ; l < count ; l++){
                    result.append(repert) ;
                }
            }
        }

        return result.toString() ;
    }
}