1.求1000以内的所有水仙花数 水仙花数:它的每个位上的数字的 n 次幂 之和等于它本身,例如:1^3 + 5^3+ 3^3 = 153 num_list = [] for i in range(1,1001): # 将数字转为字符串,遍历字符串,计算出n次幂 str_i = str(i) str_list = [] for m in str_i: str_list.append(int(m)) sum = 0 for n in str_list: sum += pow(n,len