There was an error while loading. Please reload this page.
1 parent 1f7ab0b commit d8ead90Copy full SHA for d8ead90
Dynamic Programming/91_Decode_Ways.java
@@ -0,0 +1,22 @@
1
+class Solution {
2
+ public int numDecodings(String s) {
3
+ int[] dp = new int[s.length() + 1];
4
+ dp[0] = 1;
5
+ dp[1] = s.charAt(0) != '0' ? 1 : 0;
6
+
7
+ for (int i = 2; i <= s.length(); i++) {
8
+ int oneDigit = Integer.valueOf(s.substring(i - 1, i));
9
+ int twoDigits = Integer.valueOf(s.substring(i - 2, i));
10
11
+ if (1 <= oneDigit && oneDigit <= 9) {
12
+ dp[i] += dp[i - 1];
13
+ }
14
15
+ if (10 <= twoDigits && twoDigits <= 26) {
16
+ dp[i] += dp[i - 2];
17
18
19
20
+ return dp[s.length()];
21
22
+}
0 commit comments