zoukankan      html  css  js  c++  java
  • Java for LeetCode 091 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.

    解题思路:

    dp问题,JAVA实现如下:

    		static public int numDecodings(String s) {
    		if (s.length() == 0 || s.charAt(0) == '0')
    			return 0;
    		int[] dp = new int[s.length() + 1];
    		dp[0] = dp[1] = 1;
    		for (int i = 1; i < s.length(); i++) {
    			if (s.charAt(i) == '0'&& (s.charAt(i - 1) != '1' && s.charAt(i - 1) != '2'))
    				return 0;
    			else if (s.charAt(i) == '0')
    				dp[i + 1] = dp[i - 1];
    			else if (s.charAt(i - 1) == '0'||(s.charAt(i-1)-'0')*10+(s.charAt(i)-'0')>26)
    				dp[i + 1] = dp[i];
    			else
    				dp[i + 1] = dp[i - 1] + dp[i];
    		}
    		return dp[s.length()];
    	}
    
  • 相关阅读:
    windows下安装各种python包
    error?
    PBS error
    samtools error
    samtools idxstats
    maf error
    tba error
    基因组拼接中常见的名词解释
    Spring could使用FeignClient超时问题
    sql在指定列后添加或删除字段
  • 原文地址:https://www.cnblogs.com/tonyluis/p/4516474.html
Copyright © 2011-2022 走看看