Decode Ways

[leetcode]Decode Ways

链接：https://leetcode.com/problems/decode-ways/description/

Question

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).

Solution

class Solution {
public:
  int numDecodings(string s) {
    vector<int> dp;
    dp.resize(s.size()+1, 0);

    if (s[0] == '0') return 0;
    else dp[1] = 1;
    if (s.size() >= 2) {
      string lenone = s.substr(1,1);
      string lentwo = s.substr(0,2);
      int one = stoi(lenone);
      int two = stoi(lentwo);
      if (one != 0) {
        dp[2] += 1;
      }
      if (two >= 10 && two <= 26) {
        dp[2] += 1;
      }
    }

    for (int i = 3; i <= s.size(); i++) {
      string lenone = s.substr(i-1, 1);
      string lentwo = s.substr(i-2, 2);
      int one = stoi(lenone);
      int two = stoi(lentwo);
      if (one != 0) {
        dp[i] += dp[i-1];
      }
      if (two >= 10 && two <= 26) {
        dp[i] += dp[i-2];
      }
    }
    return dp[s.size()];
  }
};

思路：第i个位置以前所有的decode方法是看自身和自身+前一个的情况，直接相加就可以了。dp[i]表示到位置i为止的decode方式。对于如123321，dp[0] = 1【1】，dp[1] = 2【1，2；12】，dp[2] = 3【1，2，3；12，3；1，23】可以看到实际上dp[2] = dp[0]+dp[1]，即如果看3的话数量是dp[0]，而如果看23的话（即3与它前一个）数量就是dp[1]。