一、问题描述
A message containing letters from A-Z
is being encoded to numbers using the following mapping:
'A' -> 1 'B' -> 2 ... 'Z' -> 26
Given an encoded message containing digits, determine the total number of ways to decode it.
For example,
Given encoded message "12"
, it could be decoded as "AB"
(1 2) or "L"
(12).
The number of ways decoding "12"
is 2.
二、问题分析
很明显这是一道dp类题。其实跟怕楼梯的那道题有点类似,因为到达某个字符有两种方式,前边的字符“走2步或者1步”,具体的看代码。
三、Java AC代码
public int numDecodings(String s) {
if(s== null || s.isEmpty() || s.charAt(0) == '0') return 0;
int[] dp = new int[s.length()+1];
dp[0] = 1;
dp[1] = 1;
for(int i = 2 ; i <= s.length() ;i++){
int num = Integer.parseInt(s.substring(i-2,i));
int twoStepsBefore = (num <= 26 && num >= 10) ? dp[i-2] : 0;
int oneStepBefore = (Integer.parseInt(s.substring(i-1,i)) != 0) ? dp[i-1] : 0;
dp[i] = twoStepsBefore + oneStepBefore; // can reach here by either hopping 2 steps or 1 step
}
return dp[s.length()];
}