最后一题是【4,2,9,2,5,3,8,7,1】么

@小心小心 【9，8，7，6，5，4，3，2，1】

``` l=[] for k in range(1,101): l.append(k*k) print(l) n=0 for k in range(1,101): n=k*k+n print(n) ```

打卡！

def initialize(context): run_daily(period, time="every_bar") # g.security1 = '000002.XSHE' # g.security2 = '000001.XSHE' # 把两个股票代码作为list存入g.security中 g.security = ['000001.XSHE','000002.XSHE'] def period(context): # order(g.security1, 100) # order(g.security2, 100) for stk in g.security: # 每个股票买100股 order(stk,100) # 获得股票持仓成本 cost = context.portfolio.positions[stk].avg_cost # 获得股票现价 price = context.portfolio.positions[stk].price # 计算收益率 ret = price/cost - 1 # 如果收益率效益-0.01，即亏损达到1%则卖出股票，幅度可以自己调，一般10% if ret < -0.01: order_target(stk,0) print("触发止损")

打卡学习

list_1 = [] result = 0 for i in range(1, 101): n = i ** 2 list_1.append(n) print(list_1) for i in range(1, 101): n = i ** 2 result += n print(result)

a=[] for i in range(1,101): n=i*i a.append(n) i+=1 print(a)

a=[] c=0 for i in range(1,101): n=i*i a.append(n) i+=1 c+=n print(a) print(c)

a = range(1,4,1) d = [] for b in a: c=b*b d.append(c) print(d) f = 0 for e in d: f=f+e print(f)

打卡

@小心小心 个人认为是的，【4,2,9,6,5,3,8,7,1】

打卡

daka

new_list = [] for t in range(1,101,1): i = t*t new_list.append(i) print(new_list)

打卡 ``` # 用for语句生成一个100项的平方数数列的list，即[1,4,9,16,...,10000] square = [i ** 2 for i in range(1, 101)] print(square) ''' [1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, 961, 1024, 1089, 1156, 1225, 1296, 1369, 1444, 1521, 1600, 1681, 1764, 1849, 1936, 2025, 2116, 2209, 2304, 2401, 2500, 2601, 2704, 2809, 2916, 3025, 3136, 3249, 3364, 3481, 3600, 3721, 3844, 3969, 4096, 4225, 4356, 4489, 4624, 4761, 4900, 5041, 5184, 5329, 5476, 5625, 5776, 5929, 6084, 6241, 6400, 6561, 6724, 6889, 7056, 7225, 7396, 7569, 7744, 7921, 8100, 8281, 8464, 8649, 8836, 9025, 9216, 9409, 9604, 9801, 10000] ''' # 用for语句计算100项的平方数数列的和，即1+4+9+16+...+10000的结果 # summation = 0 # for i in range(101): # summation += i ** 2 # print(summation) # 338350 # 以下代码输出结果是：[9, 8, 7, 6, 5, 4, 3, 2, 1] ''' 实现功能：从大到小排序，共进行[len(a) - 1] * ... * 1次排序， 每一轮循环实现找到该区间内最大的数字。 例如，loop_1找到a[0] ~ a[-1]中最大的数字，然后将最大的数字放入a[0]处； loop_2找到a[1] ~ a[-1]中最大的数字，将该数字放到a[1]处； ... loop_8，将a[-2]与a[-1]进行比较，将最大的数字放到a[-2]处。 至此，数组实现了降序排列 ''' # a = [4, 2, 1, 9, 6, 5, 3, 8, 7] # for i in range(len(a)): # len(a) --> 返回a列表的长度，即所包含的元素数 # for j in range(i+1,len(a)): # if a[j] > a[i]: # t = a[j] # a[j] = a[i] # a[i] = t # print(a) ```

继续打卡

x= 0 for i in range(1,101): i *=i x += i print(x) print(i)

b=[a**2 for a in range(1,101)] print(b) print(type(b))