【LeetCode】C# 91、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.
题意：每个大写字母对应1~26的一个数字，给定一个数字，给出所有可能的字母组合的数目。
思路：由后到前，如果s[i] == '0'则跳过，如果第位及后一位小于或等于26，则第i位个数为（i+1）+（i+2）。否则与第i+1位相同。

public 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[n-1] != '0' ? 1 : 0;

        for (int i = n - 2; i >= 0; i--)
            if (s[i] == '0') continue;
            else memo[i] = (int.Parse(s.Substring(i,2))<=26) ? memo[i+1]+memo[i+2] : memo[i+1];

        return memo[0];
    }
}