2015 年 1月 17 日随笔档案 - xgcode

2015年1月17日

摘要： class Solution {public: vector hor; vector ver; vector rightline; vector leftline; int len; int result; int totalNQueens(int n) { result ... 阅读全文

posted @ 2015-01-17 14:19 xgcode 阅读(111) 评论(0) 推荐(0)

N-Queens

摘要：题目的要点是：怎么快速判断这次的皇后和以前的是不冲突的。class Solution {public: vector hor; vector ver; vector rightline; vector leftline; int len; vector> result; vector >... 阅读全文

posted @ 2015-01-17 13:48 xgcode 阅读(130) 评论(0) 推荐(0)

Letter Combinations of a Phone Number

摘要： class Solution {public: vector result; vector letterCombinations(string digits) { string buf[] = { "abc","def","ghi","jkl","mno","pqrs","tuv... 阅读全文

posted @ 2015-01-17 10:45 xgcode 阅读(89) 评论(0) 推荐(0)

Combinations

摘要： class Solution {public: vector> result; vector temp; vector > combine(int n, int k) { temp.resize(k); GetCombine(n,k); return result; } ... 阅读全文

posted @ 2015-01-17 10:09 xgcode 阅读(124) 评论(0) 推荐(0)