![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
data Structures and algorithm
文章平均质量分 85
朔北冥
每日进步一小点---每日一水。
展开
-
alpha beta 剪枝算法
alpha-β修剪的好处在于可以消除搜索树的分支。这样,搜索时间可以限制在“更有希望”的子树中,并且可以在同一时间执行更深入的搜索。该算法和极小化极大算法一样,都是分支限界类算法。若节点搜索顺序达到最佳优化或近似最佳优化(将最佳选择排在各节点首位),则同样时间内搜索深度可达极小化极大算法的两倍多。原创 2017-05-22 21:13:43 · 3170 阅读 · 0 评论 -
LeetCode 39. Combination Sum
Given a set ofcandidate numbers (C) (without duplicates) and atarget number (T), find all unique combinations in C wherethe candidate numbers sums to T. The same repeatednumber may be chosen from C原创 2017-09-04 11:39:08 · 177 阅读 · 0 评论 -
poj 3006 Dirichlet's Theorem on Arithmetic Progressions
poj 3006 Dirichlet's Theorem onArithmetic Progressions Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19133 Ac原创 2017-09-09 20:19:26 · 272 阅读 · 0 评论 -
POJ – 1503 Integer Inquiry Integer Inquiry
POJ –1503 Integer Inquiry Integer Inquiry Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 34728 Accepted: 13523 Description One of the firstusers原创 2017-09-09 20:04:16 · 311 阅读 · 0 评论 -
POJ 1068 Parencodings
Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 27370 Accepted: 16089 Description Let S = s1s2...s2n be a well-formed string of parent原创 2017-11-13 19:07:26 · 329 阅读 · 0 评论