题目:
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.
AC代码:
public int numDecodings(String s) {
if (s.length() == 0 || (s.startsWith("0"))) {
return 0;
}
if (s.length() == 1) {
return 1;
}
int[] dp = new int[s.length() + 1];
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= s.length(); i++) {
dp[i] = s.charAt(i-1) != '0' ? dp[i - 1] : 0;
int temp = Integer.valueOf(s.substring(i - 2, i ));
dp[i] = dp[i] + ((temp >= 10 && temp <= 26) ? dp[i - 2] : 0);
}
return dp[s.length()];
}