2019-11-02 12:07:41 +08:00
|
|
|
|
# 46. 把数字翻译成字符串
|
|
|
|
|
|
|
|
|
|
|
|
[Leetcode](https://leetcode.com/problems/decode-ways/description/)
|
|
|
|
|
|
|
|
|
|
|
|
## 题目描述
|
|
|
|
|
|
|
|
|
|
|
|
给定一个数字，按照如下规则翻译成字符串：1 翻译成“a”，2 翻译成“b”... 26 翻译成“z”。一个数字有多种翻译可能，例如 12258 一共有 5 种，分别是 abbeh，lbeh，aveh，abyh，lyh。实现一个函数，用来计算一个数字有多少种不同的翻译方法。
|
|
|
|
|
|
|
|
|
|
|
|
## 解题思路
|
|
|
|
|
|
|
|
|
|
|
|
```java
|
|
|
|
|
|
public int numDecodings(String s) {
|
|
|
|
|
|
if (s == null || s.length() == 0)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
int n = s.length();
|
|
|
|
|
|
int[] dp = new int[n + 1];
|
|
|
|
|
|
dp[0] = 1;
|
|
|
|
|
|
dp[1] = s.charAt(0) == '0' ? 0 : 1;
|
|
|
|
|
|
for (int i = 2; i <= n; i++) {
|
|
|
|
|
|
int one = Integer.valueOf(s.substring(i - 1, i));
|
|
|
|
|
|
if (one != 0)
|
|
|
|
|
|
dp[i] += dp[i - 1];
|
|
|
|
|
|
if (s.charAt(i - 2) == '0')
|
|
|
|
|
|
continue;
|
|
|
|
|
|
int two = Integer.valueOf(s.substring(i - 2, i));
|
|
|
|
|
|
if (two <= 26)
|
|
|
|
|
|
dp[i] += dp[i - 2];
|
|
|
|
|
|
}
|
|
|
|
|
|
return dp[n];
|
|
|
|
|
|
}
|
|
|
|
|
|
```
|
2019-11-02 14:39:13 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-11-02 17:33:10 +08:00
|
|
|
|
<div align="center"><img width="320px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/githubio/公众号二维码-2.png"></img></div>
|
