-
Notifications
You must be signed in to change notification settings - Fork 1
/
17.cpp
55 lines (52 loc) · 1.33 KB
/
17.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/*************************************************************************
* File Name : ./17.cpp
* Author : unasm
* Mail : unasm@sina.cn
* Last_Modified: 2015-04-29 16:20:26
************************************************************************/
#include<iostream>
#include <string>
#include <vector>
using namespace std;
char mapbuf[][5] = {" ","","abc","def","ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
vector<string>res;
char buf[10000];
void deep(string digits, int pos){
char *tmp;
for (int i = 0; mapbuf[digits[pos] - '0'][i] != '\0';i++) {
//if (digits[pos + 1] == '\0') {
if (digits.size() == (pos + 1)) {
buf[pos] = mapbuf[digits[pos] - '0'][i];
res.push_back(buf);
//cout << res.size() << endl;
} else if(digits.size() > pos + 1) {
buf[pos] = mapbuf[digits[pos] - '0'][i];
deep(digits, pos + 1);
}
}
}
class Solution {
public:
vector<string> letterCombinations(string digits) {
for(int i = 0;i < 10000;i++){
buf[i] = 0;
}
res.clear();
deep(digits, 0);
cout << res.size() << endl;
return res;
}
};
int main(int argc, const char *argv[])
{
Solution s1;
vector<string>rs;
rs = s1.letterCombinations("23");
//rs = s1.letterCombinations("");
cout << rs.size() << endl;
for(int i = 0;i < rs.size(); i++){
cout << i<< endl;
cout << rs[i] << endl;
}
return 0;
}