luoganttcc

摘要：递归方法求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)

摘要：递归方法求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 阅读(3) 评论(0) 推荐(0)

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

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

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

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

摘要：递归算例一(求一个简单嵌套字典的深度) c=[]def dcc(dic): for key in dic.keys(): print (key) c.append(key) ... 阅读全文

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

摘要：递归算例一(求一个简单嵌套字典的深度) c=[]def dcc(dic): for key in dic.keys(): print (key) c.append(key) ... 阅读全文

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

摘要： c=[]def dcc(dic): for key in dic.keys(): print (key) ... 阅读全文

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

摘要： c=[]def dcc(dic): for key in dic.keys(): print (key) ... 阅读全文

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

摘要： # coding:UTF-8'''Date:20180624@author: luogan'''import numpy as n... 阅读全文

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

摘要： # coding:UTF-8'''Date:20180624@author: luogan'''import numpy as n... 阅读全文

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