public class PrintEncoding {
public static void main(String[] args) {
String str = "655196";
printEncodings(str, "");
}
public static void printEncodings(String str, String ans) {
if (str.length() == 0) {
System.out.println(ans);
return;
}
// left path
int n = str.charAt(0) - '0';
if (n == 0)
return;
printEncodings(str.substring(1), ans + (char) ('a' + n - 1));
// rigth path
if (str.length() > 1) {
n = Integer.parseInt(str.substring(0, 2));
if (n <= 26) {
printEncodings(str.substring(2), ans + (char) ('a' + n - 1));
}
}
}
}
Wednesday, February 2, 2022
Print Encodings
Subscribe to:
Post Comments (Atom)
Diagonal Traversal
eg. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Output: 1 6 11 16 2 7 12 3 8 4 Approach:...
-
I/P: 24 10 20 50 -1 60 -1 -1 30 70 -1 80 110 -1 120 -1 -1 90 -1 -1 40 100 -1 -1 -1 O/P: 10 20 30 40 50 60 70 80 90 100 110 120 import ja...
-
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/ Given the sorted rotated array nums of unique elements, retu...
-
O(1) < O(log n) < O(n) < O(n log n) < O(n ^ 2) ..... < O(2 ^ n) < O(n!) Try to keep TC till O(n ^ 2) ====================...
No comments:
Post a Comment