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).
题意:给出一串由数字组成的字符串,根据'A'对应1(不是01),‘Z’对应26的方法,求一串字符串可被翻译成多少种。
思路:从字符串尾到头遍历每个数字字符,取当前位与后一位数字组合,再进行判断:
1) 如果当前位为0,例如00...09,则当前数字不能被翻译;
2)如果当前位和后一位组合的数为10...26,则有两种翻译方法,26或2、6;
3)如果当前位和后一位组合的数大于26,例如27...99,则只能有一种翻译方法。
第n数字若不能被翻译,则记录当前数字能被翻译的方法为0 (way[n]=0)
第n数字能被翻译一种,则记录当前数字能被翻译的方法不变,和后一位数字的方法相等 (way[n] = way[n+1] )
第n数字能被翻译两种,则记录当前数字能被翻译的方法为后一位数字的方法(把当前数字视为一个字符)加上后两位数字的方法(把两位数字视为一个字符) way[n] = way[n+1] + way[n+2] ;
代码:利用动态规划
class Solution {
public int numDecodings(String s) {
int length = s.length();
if(length == 0)
return 0;
int[] ways = new int[length+1];
ways[length]=1;
ways[length-1]=s.charAt(length-1) == '0' ? 0 :1;
for(int i=length-2;i>=0;i--){
int number = Integer.parseInt(s.substring(i,i+2));
if(number< 10){ // 00...09
continue;
}
else if(number <=26){ //10...26
ways[i]=ways[i+1] + ways[i+2];
}
else {
ways[i]=ways[i+1]; //26..99
}
}
return ways[0];
}
}
代码:利用递归,结果超时
class Solution {
public int numDecodings(String s) {
if(s.length()==0 )
return 0;
return getRestNum(s);
}
public int getRestNum(String s) {
int strlen = s.length();
int num = 0;
if (strlen == 0)
return 1;
if (strlen == 1 )
{
if(s.charAt(0) == '0')
return 0;
else
return 1;
}
char lastChar = s.charAt(strlen - 1);
char secondLastChar = s.charAt(strlen - 2);
if(secondLastChar == '0' || lastChar == '0') //00 01 09
{
if(secondLastChar == '0' && lastChar == '0') //00
return 0;
else if (secondLastChar == '0') // 01
num=getRestNum(s.substring(0,strlen-1)) ;
else if(lastChar == '0') { // 10 20 30
if(secondLastChar> '2') //30 40
return 0;
num=getRestNum(s.substring(0,strlen-2)); //10 20
}
return num;
}
if(secondLastChar < '2' || (secondLastChar == '2' && lastChar <= '6')) // <26
{
num= getRestNum(s.substring(0,strlen-2)) + getRestNum(s.substring(0,strlen-1)) ;
}
else {
num=getRestNum(s.substring(0,strlen-1)) ;
}
return num;
}
}