发布于2019-08-05 11:38 阅读(665) 评论(0) 点赞(3) 收藏(3)
#
# def use_filer(l):
#
# # 过滤偶数
# rest = filter(lambda n: n % 2 != 0, l)
# return rest
#
# if __name__ == '__main__':
# l = [1,2,3,4,5,6,7,8,9,10,11]
# rest = use_filer(l)
# # [1, 3, 5, 7, 9, 11]
# print(list(rest))
#
#
#
# def pow_number(l):
# # 返回 数据的立方
# rest_list = []
# for x in l:
# rest_list.append(x * x * x)
# return rest_list
#
# def f(n):
# return n * n * n
#
# def pow_num_use_map(l):
# return map(f,l)
#
#
# def pow_num_use_lambda(l):
# return map(lambda n:n * n * n,l)
#
#
#
# if __name__ == '__main__':
# l = [1,2,3,4,5,6,7,8,9,10]
# rest = pow_number(l)
# # [1, 8, 27, 64, 125, 216, 343, 512, 729, 1000]
# print (rest)
# print ('--------------------------')
# rest_map = pow_num_use_map(l)
# # [1, 8, 27, 64, 125, 216, 343, 512, 729, 1000]
# print (list(rest_map))
# print ('--------------------------')
# rest_lambda = pow_num_use_lambda(l)
# # [1, 8, 27, 64, 125, 216, 343, 512, 729, 1000]
# print (list(rest_lambda))
# 求和
def get_sum(l):
rest = 0
for i in l:
rest += i
return rest
def get_sum_use_py(l):
return sum(l)
from functools import reduce
def f(m,n):
return m + n
def get_sum_use_reduce(l):
return reduce(f,l)
def get_sum_use_lamdad(l):
return reduce(lambda m , n : m + n,l)
if __name__ == '__main__':
l = [1,2,4,6,7,8,9]
rest = get_sum(l)
# 37
print (rest)
print('------------------')
rest_py = get_sum_use_py(l)
print (rest_py)
print('------------------')
rest_reduce = get_sum_use_reduce(l)
print (rest_reduce)
print('------------------')
rest_lamdad = get_sum_use_lamdad(l)
print (rest_lamdad)
作者:爬虫soeary
链接:https://www.pythonheidong.com/blog/article/4384/94b0a2a2c59f5519ca62/
来源:python黑洞网
任何形式的转载都请注明出处,如有侵权 一经发现 必将追究其法律责任
昵称:
评论内容:(最多支持255个字符)
---无人问津也好,技不如人也罢,你都要试着安静下来,去做自己该做的事,而不是让内心的烦躁、焦虑,坏掉你本来就不多的热情和定力
Copyright © 2018-2021 python黑洞网 All Rights Reserved 版权所有,并保留所有权利。 京ICP备18063182号-1
投诉与举报,广告合作请联系vgs_info@163.com或QQ3083709327
免责声明:网站文章均由用户上传,仅供读者学习交流使用,禁止用做商业用途。若文章涉及色情,反动,侵权等违法信息,请向我们举报,一经核实我们会立即删除!