leetcode--Decode Ways

来源:互联网 发布:js调用java代码 编辑:程序博客网 时间:2024/05/01 19:49

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.

public class Solution {    public int numDecodings(String s) {int len = s.length();if(len == 0) return 0;int[] flag = new int[len+1];flag[len] = 1;if(s.charAt(len-1)!='0'){flag[len-1] = 1;}else{flag[len-1] = 0;}for(int i=len-2;i>=0;i--){if(s.charAt(i)=='0') flag[i]=0;    else{    if(s.charAt(i)>'2'||(s.charAt(i)=='2'&&s.charAt(i+1)>'6')){    flag[i] = flag[i+1];    }else{    flag[i] = flag[i+1]+flag[i+2];    }}}return flag[0];    }}

0 0
原创粉丝点击