Categorygithub.com/szhou12/leetcode-goleetcode0017-Letter-Combinations-of-a-Phone-Number
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

17. Letter Combinations of a Phone Number

Solution idea

DFS

比较标准的DFS题

Assume each digit is mapped to $3$ characters.

Time complexity = $O(3^n)$ where $n$ is number of digits from input