A message containing letters from A-Z
is being encoded to numbers using the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Given a non-empty string containing only digits, determine the total number of ways to decode it.
Example 1:
Input: "12"
Output: 2
Explanation: It could be decoded as "AB" (1 2) or "L" (12).
Example 2:
Input: "226"
Output: 3
Explanation: It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).
代码:
class Solution {
public int numDecodings(String s) {
int n=s.length();
if(n==0)return 0;
int[]memo=new int[n+1];
memo[n]=1;
memo[n-1]=s.charAt(n-1)=='0'?0:1;
for(int i=n-2;i>=0;i--){
if(s.charAt(i)=='0'){
continue;
}else{
memo[i]=Integer.parseInt(s.substring(i,i+2))<=26?memo[i+1]+memo[i+2]:memo[i+1];
}
}
return memo[0];
}
}
代码