摘要:
sum = 0 # 1、以循环计算 1*1+2*2+3*3+...+n*n n = 5 for i in range(1, n + 1): sum += i * i print("循环后的结果:" + str(sum)) # 2、以递归计算1*1+2*2+3*3+4*4+...+n*n def jishuna(k): if k == 0: return 0 ... 阅读全文
摘要:
<script src="../../lib/persist-min.js"></script> //测试一下本地化存储器 var store = new Persist.Store('menu_store');store.set("mytestid",1); var mytestid=store. 阅读全文