arkorty/LeetCode
1
0
Fork 0
mirror of https://github.com/arkorty/LeetCode.git synced 2026-03-18 00:57:17 +00:00
Code Issues Packages Projects Releases Wiki Activity

Refactor Medium/letter-combinations-of-a-phone-number/solution.cpp

Browse Source
This commit is contained in:
Arkaprabha Chakraborty
2022-08-07 01:00:33 +05:30
parent cab1180397
commit 892938d479
1 changed files with 4 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
Medium/letter-combinations-of-a-phone-number/solution.cpp
View File

@@ -4,11 +4,8 @@
class Solution { class Solution {
public: public:
std::vector<std::string> letterCombinations(std::string digits) { std::vector<std::string> letterCombinations(std::string digits) {
std::string letters[] = {"abc", "def", "ghi", "jkl", std::string letters[] = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
"mno", "pqrs", "tuv", "wxyz"};
std::vector<std::string> finvec; std::vector<std::string> finvec;
if (digits.length() == 1) { if (digits.length() == 1) {
std::string tmplet = letters[(int)digits[0] - 50]; std::string tmplet = letters[(int)digits[0] - 50];
@@ -20,11 +17,9 @@ public:
else if (digits.length() == 2) { else if (digits.length() == 2) {
std::string tmplet_0 = letters[(int)digits[0] - 50]; std::string tmplet_0 = letters[(int)digits[0] - 50];
std::string tmplet_1 = letters[(int)digits[1] - 50]; std::string tmplet_1 = letters[(int)digits[1] - 50];
for (int i = 0; i < tmplet_0.length(); ++i) { for (int i = 0; i < tmplet_0.length(); ++i) {
for (int j = 0; j < tmplet_1.length(); ++j) { for (int j = 0; j < tmplet_1.length(); ++j) {
finvec.push_back(std::string("") + tmplet_0[i] + finvec.push_back(std::string("") + tmplet_0[i] + tmplet_1[j]);
tmplet_1[j]);
} }
} }
} }
@@ -33,12 +28,10 @@ public:
std::string tmplet_0 = letters[(int)digits[0] - 50]; std::string tmplet_0 = letters[(int)digits[0] - 50];
std::string tmplet_1 = letters[(int)digits[1] - 50]; std::string tmplet_1 = letters[(int)digits[1] - 50];
std::string tmplet_2 = letters[(int)digits[2] - 50]; std::string tmplet_2 = letters[(int)digits[2] - 50];
for (int i = 0; i < tmplet_0.length(); ++i) { for (int i = 0; i < tmplet_0.length(); ++i) {
for (int j = 0; j < tmplet_1.length(); ++j) { for (int j = 0; j < tmplet_1.length(); ++j) {
for (int k = 0; k < tmplet_2.length(); ++k) { for (int k = 0; k < tmplet_2.length(); ++k) {
finvec.push_back(std::string("") + tmplet_0[i] + finvec.push_back(std::string("") + tmplet_0[i] + tmplet_1[j] + tmplet_2[k]);
tmplet_1[j] + tmplet_2[k]);
} }
} }
} }
@@ -49,14 +42,11 @@ public:
std::string tmplet_1 = letters[(int)digits[1] - 50]; std::string tmplet_1 = letters[(int)digits[1] - 50];
std::string tmplet_2 = letters[(int)digits[2] - 50]; std::string tmplet_2 = letters[(int)digits[2] - 50];
std::string tmplet_3 = letters[(int)digits[3] - 50]; std::string tmplet_3 = letters[(int)digits[3] - 50];
for (int i = 0; i < tmplet_0.length(); ++i) { for (int i = 0; i < tmplet_0.length(); ++i) {
for (int j = 0; j < tmplet_1.length(); ++j) { for (int j = 0; j < tmplet_1.length(); ++j) {
for (int k = 0; k < tmplet_2.length(); ++k) { for (int k = 0; k < tmplet_2.length(); ++k) {
for (int l = 0; l < tmplet_3.length(); ++l) { for (int l = 0; l < tmplet_3.length(); ++l) {
finvec.push_back(std::string("") + tmplet_0[i] + finvec.push_back(std::string("") + tmplet_0[i] + tmplet_1[j] + tmplet_2[k] + tmplet_3[l]);
tmplet_1[j] + tmplet_2[k] +
tmplet_3[l]);
} }
} }
} }