摘要:
DFS int cnt[10] = {0,0,3,3,3,3,3,4,3,4}; char map[10][5] = {"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"}; vector letterCombinations(string digits) { // Start typing your C/C++ solution bel 阅读全文
posted @ 2013-08-11 17:32
summer_zhou
阅读(177)
评论(0)
推荐(0)
摘要:
Q:八皇后问题。DFS vector > solveNQueens(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > result; if(n positions; Queens(0,n,positions,result); return result; } void Queens(int ... 阅读全文
posted @ 2013-08-11 16:37
summer_zhou
阅读(160)
评论(0)
推荐(0)
浙公网安备 33010602011771号