【LeetCode】#91解码方法(Decode Ways)
题目描述
一条包含字母 A-Z 的消息通过以下方式进行了编码:
‘A’ -> 1
‘B’ -> 2
…
‘Z’ -> 26
给定一个只包含数字的非空字符串,请计算解码方法的总数。
示例
示例 1:
输入: “12”
输出: 2
解释: 它可以解码为 “AB”(1 2)或者 “L”(12)。
示例 2:
输入: “226”
输出: 3
解释: 它可以解码为 “BZ” (2 26), “VF” (22 6), 或者 “BBF” (2 2 6) 。
Description
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
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) {
if(s==null || s.length()==0){
return 0;
}
char[] ch = s.toCharArray();
int n = ch.length;
int[] nums = new int[n];
if(ch[n-1]!='0'){
nums[n-1] = 1;
}
for(int i=n-2; i>=0; i--){
if(ch[i]=='0'){
continue;
}
if(ch[i]=='1' || ch[i]=='2' && ch[i+1]<='6'){
if(i==n-2){
nums[i] = nums[i+1]+1;
}else{
nums[i] = nums[i+1]+nums[i+2];
}
}else{
nums[i] = nums[i+1];
}
}
return nums[0];
}
}