梦想照进现实

有3种常见的算法实现该要求，下面将按效率由低到高依次实现： # def f1(arg):     """     """     if not isinstance(arg, type([])):         return -1     max = sum = 0     for e in arg:         for i in arg[arg.index(e):]:             sum =

Python 绝对简明手册 -- zsp007@gmail.com ::-- ZoomQuiet [2006-09-15 04:35:33] Contents 阅读须知 基本语法 if / elif / else in for ... in break / continue while / pass is del try ... except ... finally

算法是比较低效的，时间复杂度为O(N3).仅仅是为了练习Python.#-*- coding:gb2312 -*-"""北大ACM 1001 exponentiation基本思路： 1.3099*12 去掉小数点后倒序得到[9,9,0,3,1] [9,9,3,0,1] * [9,9,0,3,1] = [9,9,0,3,1]*9*10^0 = [81, 81, 0,27, 9] + [9,9,0