if (s.empty() || s[0] == '0')
return 0;
int prev = 0;
int curr = 1;
for (int i = 1; i <= s.size(); i++)
{
if (s[i - 1] == '0')
curr = 0;
if (i < 2 || !(s[i - 2] == '1' || s[i - 2] == '2' && s[i - 1] <= '6'))
prev = 0;
int temp = curr;
curr = curr + prev;
prev = temp;
}
return curr;
【LeetCode】Decode Ways
最新推荐文章于 2019-05-23 09:48:25 发布