随笔分类 -  算法

Monte Carlo Tree Search – beginners guide
摘要：Monte Carlo Tree Search – beginners guide 蒙特卡洛树搜索（新手教程） 阅读全文
posted @ 2019-08-31 14:14 ChuckLu 阅读(289) 评论(0) 推荐(0)
算法可视化
摘要：https://visualgo.net/en visualising data structures and algorithms through animation https://algorithm-visualizer.org/ https://github.com/algorithm-vi 阅读全文
posted @ 2019-06-03 16:43 ChuckLu 阅读(599) 评论(0) 推荐(0)
BFS广度优先 vs DFS深度优先 for Binary Tree
摘要：https://www.geeksforgeeks.org/bfs-vs-dfs-binary-tree/ What are BFS and DFS for Binary Tree? A Tree is typically traversed in two ways: Breadth First T 阅读全文
posted @ 2019-04-02 21:23 ChuckLu 阅读(431) 评论(0) 推荐(0)
Depth-first search and Breadth-first search 深度优先搜索和广度优先搜索
摘要：Depth-first search Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the roo 阅读全文
posted @ 2019-04-02 21:10 ChuckLu 阅读(972) 评论(0) 推荐(0)
The Mathematics of the Rubik’s Cube
摘要：https://web.mit.edu/sp.268/www/rubik.pdf Introduction to Group Theory and Permutation Puzzles March 17, 2009 Introduction Almost everyone has tried to 阅读全文
posted @ 2019-03-15 12:47 ChuckLu 阅读(281) 评论(0) 推荐(0)
11. Container With Most Water
摘要：Container With Most Water - LeetCode Container with Most Water - GeeksforGeeks Approach : This implies that if there was a better solution possible, i 阅读全文
posted @ 2019-02-02 17:12 ChuckLu 阅读(170) 评论(0) 推荐(0)
dancing links
摘要：跳跃的舞者，舞蹈链（Dancing Links）算法——求解精确覆盖问题 算法实践——舞蹈链（Dancing Links）算法求解数独 https://arxiv.org/pdf/cs/0011047v1.pdf 阅读全文
posted @ 2018-06-07 20:31 ChuckLu 阅读(203) 评论(0) 推荐(0)
Modular_exponentiation模幂运算
摘要：https://en.wikipedia.org/wiki/Modular_exponentiation 蒙哥马利(Montgomery)幂模运算是快速计算a^b%k的一种算法，是RSA加密算法的核心之一。 蒙哥马利模乘的优点在于减少了取模的次数（在大数的条件下）以及简化了除法的复杂度（在2的k次幂 阅读全文
posted @ 2016-03-23 00:10 ChuckLu 阅读(2081) 评论(0) 推荐(0)
SHA-1
摘要：https://en.wikipedia.org/wiki/SHA-1Incryptography,SHA-1(Secure Hash Algorithm 1) is acryptographic hash functiondesigned by the United StatesNational ... 阅读全文
posted @ 2015-09-27 17:54 ChuckLu 阅读(321) 评论(0) 推荐(0)
几种方法的尾递归实现
摘要：http://freejvm.iteye.com/blog/976878需要找时间验证一下，另外还需要学习多个参数的尾递归如何来实现的技巧斐波那契数列第n个数的求值， public static long fibo4(int n) { if (n //... 阅读全文
posted @ 2015-07-10 09:24 ChuckLu 阅读(938) 评论(0) 推荐(0)
求质数的几种算法
摘要：The most efficient algorithm for determining whether a number is prime involves several optimizations over the basic trial division method. The most w 阅读全文
posted @ 2015-07-07 15:08 ChuckLu 阅读(39485) 评论(0) 推荐(0)
判断2个正整数是否互质
摘要：1. Two positive integers i and j are considered to be co-prime if there exists no integer greater than 1 that divides them both.Write a function co-p... 阅读全文
posted @ 2015-07-07 14:14 ChuckLu 阅读(1346) 评论(0) 推荐(0)