首页 > 其他 > 详细

Jan 23 - Decode Ways; DP; Array;

时间:2016-01-24 15:27:23      阅读:158      评论:0      收藏:0      [点我收藏+]
public class Solution {
    public int numDecodings(String s) {
        int len = s.length();
        if(len == 0) return 0;
        int[] counts = new int[len];
        counts[0] = 0;
        for(int i = 0; i < len; i++){
            int flag = 0;
            if(i == 0) {
                if(s.charAt(i) != ‘0‘) counts[i] = 1;
                else counts[i] = 0;
                continue;
            }
            if(i == 1){
                int mes = Integer.parseInt(s.charAt(i-1)+""+s.charAt(i));
                if(mes >= 10 && mes <= 26) {
                   flag++;
                }
                if(s.charAt(i) != ‘0‘) flag++;
                if(flag == 2) counts[i] = counts[i-1]+1;
                if(flag == 1) counts[i] = counts[i-1];
                if(flag == 0) counts[i] = 0;
                continue;
            }
            
                int mes = Integer.parseInt(s.charAt(i-1)+""+s.charAt(i));
                if(mes >= 10 && mes <= 26) {
                    flag++;
                    counts[i] = counts[i-2];
                }
                if(s.charAt(i) != ‘0‘) {
                    flag++;
                    counts[i] = counts[i-1];
                }
                if(flag == 2) counts[i] = counts[i-2]+counts[i-1];
            
        }
        
        return counts[len-1];
    }
}

 

Jan 23 - Decode Ways; DP; Array;

原文:http://www.cnblogs.com/5683yue/p/5155091.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!