Write a function to generate the generalized abbreviations of a word.
Example:
Given word = "word"
, return the following list (order does not matter):
["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]
思路:
好久没写代码,这么一道破题,写了我一个多小时。思路很简单,就是一个backtracking,注意几点。
1. 当替换字母为数字时,比如word变成2rd,注意这个时候所有字符的顺序都会换。所以这里要注意
2. test case里面有超过10位的word,这个时候要注意替换的字符由1位数,变成了2位数。这里也需要注意。
3. backtracking,dfs不能手生啊,得多练
class Solution {
public:
vector<string> generateAbbreviations(string word) {
vector<string> result;
string cur = word;
result.push_back(word);
helper(result,cur,word.size(),0,word);
return result;
}
private:
void helper(vector<string>& result,string cur,int num,int idx,string word) {
for (int i = idx; i < word.size(); i++) {
for (int len = 1; len <= num && i+len-1 < cur.size(); len++) {
string tmp = cur;
tmp.replace(i, len, to_string(len));
result.push_back(tmp);
helper(result, tmp, num, i+to_string(len).size()+1, word);
}
}
}
};