摘要：
View Code #include<iostream>usingnamespace std;char ch[101];int mark=0 , cnt; int len;void dfs(int x , int y , int i ){ if( x < y ) { return ; } if( y == x && i == len ) { cnt++; } if(ch[i]=='?') { dfs(x+1 , y , i +1 ); dfs(x, y +1 , i +1 ); } ... 阅读全文
