dfs
此间少年_leozp
这个作者很懒,什么都没留下…
展开
-
Leetcode: N-Queens
Leetcode: N-QueensThe n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to t原创 2016-07-23 10:11:17 · 192 阅读 · 0 评论 -
Leetcode: N-Queens II
N-Queen ||Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.Subscribe to see which companies asked this q原创 2016-07-23 10:20:03 · 188 阅读 · 0 评论 -
Leetcode:Word Search
/** * 跟走迷宫类似,设置一个标记数组,记录下已经走过的点,dfs深搜,如果能搜到word的末尾,return true * */class Solution {public: int dx[4]={1,-1,0,0}; int dy[4]={0,0,1,-1}; int n,m; bool exist(vector>& board, string原创 2016-07-28 22:09:44 · 196 阅读 · 0 评论 -
Leetcode: Generate Parentheses
/*dfs回溯当left>right || left>0 || right>0 时可以减枝*/class Solution {public: vector generateParenthesis(int n) { vectoranswer; dfs(answer,"",n,n); return answer; } v原创 2016-08-31 16:50:00 · 359 阅读 · 0 评论