摘要: Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions. Example For n=4, there ar 阅读全文
posted @ 2016-04-01 16:32 哥布林工程师 阅读(153) 评论(0) 推荐(0) 编辑
摘要: The n-queens puzzle is the problem of placing n queens on an n×nchessboard such that no two queens attack each other. Given an integer n, return all d 阅读全文
posted @ 2016-04-01 16:30 哥布林工程师 阅读(156) 评论(0) 推荐(0) 编辑
摘要: Given a string source and a string target, find the minimum window in source which will contain all the characters in target. Notice If there is no su 阅读全文
posted @ 2016-04-01 12:53 哥布林工程师 阅读(158) 评论(0) 推荐(0) 编辑