腾讯解压算法 c++

腾讯的解压算法C的具体实现可以参考以下代码：

#include <iostream>
#include <string>
#include <stack>
using namespace std;

int main() {
    string str;
    cin >> str;
    stack<int> s;
    for (int right = 0; right < str.length(); right++) {
        if (str[right == '[' || str[right == '|') {
            s.push(right);
        }
        if (str[right == ']') {
            int k = s.top();
            s.pop();
            int left = s.top();
            s.pop();
            int num = stoi(str.substr(left + 1, k - left - 1));
            string s1 = str.substr(k + 1, right - k - 1);
            string s2;
            for (int i = 0; i < num; i++) {
                s2 += s1;
            }
            str = str.replace(left, right - left + 1, s2);
            right = left + s2.size() - 1;
        }
    }
    cout << str;
}

这段代码通过使用栈来辅助解压缩。它遍历输入的字符串，当遇到'['或'|'时，将其索引位置压入栈中。当遇到']'时，从栈中弹出'['和'|'的索引位置，通过计算这两个索引位置之间的子字符串进行解压缩并替换原来的部分。最后输出解压缩后的字符串。
#### 引用[.reference_title]
- *1* *3* [压缩算法_腾讯笔试](https://blog.csdn.net/qq_40212930/article/details/105011077)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 50%"]
- *2* [Leetcode刷题笔记题解（C++）：腾讯笔试压缩算法（栈）](https://blog.csdn.net/qq_27524749/article/details/108181125)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]