TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl
and it returns a short URL such as http://tinyurl.com/4e9iAk
.
Design the encode
and decode
methods for the TinyURL service. There is no restriction on how your encode/decode algorithm should work. You just need to ensure that a URL can be encoded to a tiny URL and the tiny URL can be decoded to the original URL.
题目的要求是实现URL的“编码”与“解码”,自己实现相应的encode方法跟decode方法。而我的思路是:每个short URL都是类似于题目中所给的示例,为题的不同在于最后的值,如4e9iAK。所以,我的编码方式是,将获得的long URL转化为一个哈希值,作为short URL最后的参数,生成相对应的short URL,并利用map<string, string>将long URL跟short URL存储起来,在decode方法中便根据short URl直接返回long URl:
// Encodes a URL to a shortened URL.
string encode(string longUrl) {
long long key = hash(longUrl);
string shortUrl = "http://tinyurl.com/";
shortUrl += toString(key);
urls.insert(pair<string, string>(shortUrl, longUrl));
return shortUrl;
}
// Decodes a shortened URL to its original URL.
string decode(string shortUrl) {
return urls.find(shortUrl)->second;
}
完整的代码:
using namespace std;
class Solution {
public:
map<string, string> urls;
long long hash(string url) {
long long h = 0;
for (int i = 0; i < (int)url.length(); i++) {
h = h * 10 + url[i];
}
return h;
}
string toString(long long num) {
string number;
stringstream strstream;
strstream << num;
strstream >> number;
return number;
}
// Encodes a URL to a shortened URL.
string encode(string longUrl) {
long long key = hash(longUrl);
string shortUrl = "http://tinyurl.com/";
shortUrl += toString(key);
urls.insert(pair<string, string>(shortUrl, longUrl));
return shortUrl;
}
// Decodes a shortened URL to its original URL.
string decode(string shortUrl) {
return urls.find(shortUrl)->second;
}
};