Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

[pull] main from itcharge:main #21

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 4 commits into AlgorithmAndLeetCode:main from itcharge:main
Aug 3, 2022
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update 0091. 解码方法.md
  • Loading branch information
itcharge committed Aug 3, 2022
commit fed73086e48b5772f88a409e31cf495bb38d7567
14 changes: 12 additions & 2 deletions Solutions/0091. 解码方法.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,19 @@

## 题目大意

**描述**:给定一个数字字符串 `s`,按照要求映射为 `26` 个字母。`1` 映射为 `A`,`2` 映射为 `B`,...,`26` 映射为 `Z`。
**描述**:给定一个数字字符串 `s`。该字符串已经按照下面的映射关系进行了编码:

**要求**:计算出共有多少种可能的翻译方案。
- `A` 映射为 `1`。
- `B` 映射为 `2`。
- ...
- `Z` 映射为 `26`。

基于上述映射的方法,现在对字符串 `s` 进行「解码」。即从数字到字母进行反向映射。比如 `"11106"` 可以映射为:

- `"AAJF"`,将消息分组为 `(1 1 10 6)`。
- `"KJF"`,将消息分组为 `(11 10 6)`。

**要求**:计算出共有多少种可能的解码方案。

**说明**:

Expand Down

AltStyle によって変換されたページ (->オリジナル) /