[leetcode] 320. Generalized Abbreviation 解题报告

题目链接: https://leetcode.com/problems/generalized-abbreviation/

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"]

思路: DFS + 回溯. 每一次枚举数字化几位, 需要注意的是如果没有完全将后面的字符数字化的话, 每两段之间至少需要有一个字符的间隔.

代码如下:

class Solution {
public:
    void DFS(vector<string>& result, string word, string str)
    {
        if(word.size()==0) return result.push_back(str);
        DFS(result, word.substr(1), str+word[0]);
        for(int i= 1; i< word.size(); i++)
            DFS(result, word.substr(i+1), str+to_string(i)+word[i]);
        DFS(result, "", str+to_string(word.size()));
    }
    
    vector<string> generateAbbreviations(string word) {
        vector<string> result;
        DFS(result, word, "");
        return result;
    }
};