[leetcode] 271. Encode and Decode Strings 解题报告

题目链接: https://leetcode.com/problems/encode-and-decode-strings/

Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.

Machine 1 (sender) has the function:

string encode(vector<string> strs) {
  // ... your code
  return encoded_string;
}
Machine 2 (receiver) has the function:
vector<string> decode(string s) {
  //... your code
  return strs;
}

So Machine 1 does:

string encoded_string = encode(strs);

and Machine 2 does:

vector<string> strs2 = decode(encoded_string);

strs2 in Machine 2 should be the same as strs in Machine 1.

Implement the encode and decode methods.

Note:

  • The string may contain any possible characters out of 256 valid ascii characters. Your algorithm should be generalized enough to work on any possible characters.
  • Do not use class member/global/static variables to store states. Your encode and decode algorithms should be stateless.
  • Do not rely on any library method such as eval or serialize methods. You should implement your own encode/decode algorithm.

思路: 刚开始思路是用一个字符标记一个字符串的结尾, 如果在字符中出现过,就添加两次, 结尾一个. 但是这样出现了一堆bug. 然后看了别人的做法发现思路要比我的好很多, 编码一个字符串用长度+特殊字符+字符串来编码. 解码时找到那个特殊字符串,然后前面又有了字符串的长度, 这样就不用考虑是否出现过这个字符了. 非常好的思路.

代码如下:

class Codec {
public:

    // Encodes a list of strings to a single string.
    string encode(vector<string>& strs) {
        string result;
        for(auto str: strs) result += to_string((int)str.size())+"$"+str;   
        return result;
    }

    // Decodes a single string to a list of strings.
    vector<string> decode(string s) {
        vector<string> result;
        int len = s.size(), pos = 0;
        while(pos < len)
        {
            int k = s.find('$', pos), num = stoi(s.substr(pos, k-pos));
            result.push_back(s.substr(k+1, num));
            pos = k+num+1;
        }
        return result;
    }
};

// Your Codec object will be instantiated and called as such:
// Codec codec;
// codec.decode(codec.encode(strs));
参考: https://leetcode.com/discuss/54906/accepted-simple-c-solution


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值