luoganttcc

摘要： class Student(object): def __init__(self, name, score): ... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(27) 评论(0) 推荐(0)

摘要：一文深入理解协同过滤写在之前…从这篇文章开始,我的下一个算法职业生涯方向将专注于推荐算法… 看了那么多书和代码,还是peter 的那本>最为经典,说实话很多中国人写的书确实不怎么样…那么,开始吧.本文代码从赵志勇的那本书上修改而... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(13) 评论(0) 推荐(0)

摘要： Python 求最大子集的递归实现 def PowerSetsRecursive(items): """Use recursive call to return all subsets of items, include em... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(16) 评论(0) 推荐(0)

摘要： Python 求最大子集的递归实现 def PowerSetsRecursive(items): """Use recursive call to return all subsets of items, include em... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(11) 评论(0) 推荐(0)

摘要： def PowerSetsRecursive(items): """Use recursive call to retur... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(27) 评论(0) 推荐(0)

摘要： def PowerSetsRecursive(items): """Use recursive call to retur... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(21) 评论(0) 推荐(0)

摘要： kk=5def factorial(n): result = 1 for i in range(2, n+1): ... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(12) 评论(0) 推荐(0)

摘要： kk=5def factorial(n): result = 1 for i in range(2, n+1): ... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(30) 评论(0) 推荐(0)

摘要：递归方法求n! def jiec(n): if n==0: return 1 else: return n*jiec(n-1)ss=jiec(10)print(ss) 3628800 ... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(6) 评论(0) 推荐(0)

摘要： def jiec(n): if n==0: return 1 else: return n*... 阅读全文

posted @ 2022-08-19 22:57 luoganttcc 阅读(18) 评论(0) 推荐(0)