data Structures and algorithm
文章平均质量分 84
朔北冥
每日进步一小点---每日一水。
展开
-
alpha beta 剪枝算法
alpha-β修剪的好处在于可以消除搜索树的分支。这样,搜索时间可以限制在“更有希望”的子树中,并且可以在同一时间执行更深入的搜索。该算法和极小化极大算法一样,都是分支限界类算法。若节点搜索顺序达到最佳优化或近似最佳优化(将最佳选择排在各节点首位),则同样时间内搜索深度可达极小化极大算法的两倍多。原创 2017-05-22 21:13:43 · 3200 阅读 · 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 · 187 阅读 · 0 评论 -
poj 3006 Dirichlet's Theorem on Arithmetic Progressions
poj 3006 Dirichlet's Theorem onArithmetic ProgressionsDirichlet's Theorem on Arithmetic ProgressionsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 19133Ac原创 2017-09-09 20:19:26 · 285 阅读 · 0 评论 -
POJ – 1503 Integer Inquiry Integer Inquiry
POJ –1503 Integer Inquiry Integer InquiryTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 34728Accepted: 13523DescriptionOne of the firstusers原创 2017-09-09 20:04:16 · 325 阅读 · 0 评论 -
POJ 1068 Parencodings
ParencodingsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 27370Accepted: 16089DescriptionLet S = s1s2...s2n be a well-formed string of parent原创 2017-11-13 19:07:26 · 337 阅读 · 0 评论