[LeetCode]Decode Ways

 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. 

LeetCode: https://oj.leetcode.com/problems/decode-ways/

题解：本题可以采用动态规划的思想来求解，关键点在于求解出递推式，假设字符串S的长度为n，我们要求解的解码方法个数为 f(n-1)，则我们可以得到如下递推式：

if s[i] == 0 && (s[i-1] == 1 || s[i-1] == 2)  ; then:     f(i) = f(i-2)

if (s[i-1] == 0)  ||  (s[i-1] >= 3)  ||   (s[i-1] == 2 && s[i] >= 7)   ; then:    f(i) = f(i-1)

else : f(i) = f(i-1) + f(i-2)

代码如下：

public class Solution {
    public int numDecodings(String s) {
       if(s == null || s.length() == 0 || s.charAt(0) == '0')
            return 0;
        int num1 = 1;
        int num2 = 1;
        int num3 = 1;
        
        for(int i = 1; i < s.length(); i++){
            if(s.charAt(i) == '0'){
                if(s.charAt(i-1) == '1' || s.charAt(i-1) == '2')
                    num3 = num1;
                else
                    return 0;
            }else{
                if(s.charAt(i-1) > '2' || (s.charAt(i-1) == '2' && (s.charAt(i) > '6')) || s.charAt(i-1) == '0')
                    num3 = num2;
                else
                    num3 = num1 + num2;
            }
            num1 = num2;
            num2 = num3;
        }
        return num3;
    }
}

本题其实和求解斐波那契数列以及跳台阶（每步可以跳一个或两个台阶，求跳n个台阶的方法）非常类似，只不过需要考虑几个特殊情况