LeetCode 17：电话号码的字母组合（Letter Combinations of a Phone Number）解法汇总

更多LeetCode题解

My Solution

本质上是一个字符串拼接的问题，输入n个数字，对应n个字符串，将这n个字符串以各种方式拼接。

采用减而治之的策略，变成两个两个字符串数组的拼接。

class Solution {
   
public:
	vector<vector<string>> v = {
    {
   "a","b","c"}, {
   "d","e","f"}, {
   "g","h","i"}, {
   "j",