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.
不会写,参考别人的代码。
Source
public class Solution {
public int numDecodings(String s) {
if(s.length() == 0 || s == "0") return 0;
int[] num = new int[s.length() + 1];
num[0] = 1;
if(s.charAt(0) != '0') num[1] = 1;
else num[1] = 0;
for(int i = 2; i <= s.length(); i++){
if(s.charAt(i - 1) != '0')
num[i] = num[i - 1];
else num[i] = 0;
if(s.charAt(i - 2) == '1' || (s.charAt(i - 2) == '2' && s.charAt(i - 1) <= '6'))
num[i] += num[i - 2];
}
return num[s.length()];
}
}
Test
public static void main(String[] args){
String s = "12";
System.out.println(new Solution().numDecodings(s));
}