![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
whilewk
The best way to write secure and reliable applications. Write nothing; deploy nowhere.
展开
-
求最大公约数
两个正整数a和b(a>b),他们的最大公约数等于a除以b的余数c和b之间的最大公约数 func getGreatestCommonDivisor(a,b int) int { big := 0 small := 0 if a > b { big = a small = b }else { big = b small = a } if big % small == 0 { return small } return getGreatestCommonD.原创 2020-05-25 19:51:25 · 202 阅读 · 0 评论 -
红黑树
红黑树介绍: https://www.cnblogs.com/skywang12345/p/3245399.html https://blog.csdn.net/qq826364410/article/details/79730911#comments 红黑树demo: https://www.cs.usfca.edu/~galles/visualization/RedBlack.html...转载 2018-12-19 13:58:52 · 140 阅读 · 0 评论 -
KMP算法
参考:https://www.cnblogs.com/yjiyjige/p/3263858.html public static int GetKMP(String ts, String ps) { char[] t = ts.ToCharArray(); char[] p = ps.ToCharArray(); ...转载 2018-12-19 14:53:47 · 103 阅读 · 0 评论