Replace wild cards with all possible combinations of zeros and ones using recurs - 我的博客 - ITeye技术网站

Replace wild cards with all possible combinations of zeros and ones using recurs - 我的博客 - ITeye技术网站
Replace wild cards with all possible combinations of zeros and ones using recursion.

Input String: 0?1?

Output: 0010, 0011, 0110, 0111

1. public List<String> replaceQuestionMark(String s) {  
2.     List<String> result = new LinkedList<String>();  
3.     replaceQuestionMarkRecursive(result, s.toCharArray(), 0);  
4.     return result;  
5. }  
6.   
7. private void replaceQuestionMarkRecursive(List<String> result, char[] chars, int start) {  
8.     if(start == chars.length) {  
9.         result.add(new String(chars));  
10.         return;  
11.     }  
12.     if(chars[start] == '?') {  
13.         chars[start] = '0';  
14.         replaceQuestionMarkRecursive(result, chars, start+1);  
15.         chars[start] = '1';  
16.         replaceQuestionMarkRecursive(result, chars, start+1);  
17.         chars[start] = '?'; //backtrack
18.     } else {  
19.         replaceQuestionMarkRecursive(result, chars, start+1);  
20.     }  
21. }  

http://blog.csdn.net/yuanhisn/article/details/46117515
Read full article from Replace wild cards with all possible combinations of zeros and ones using recurs - 我的博客 - ITeye技术网站