2018-10-22 18:36:08 +00:00
|
|
|
# NguyenU
|
|
|
|
|
|
2019-10-05 05:14:13 +00:00
|
|
|
|
2018-10-22 18:36:08 +00:00
|
|
|
def find_max(nums):
|
2019-10-28 08:14:53 +00:00
|
|
|
"""
|
|
|
|
|
>>> for nums in ([3, 2, 1], [-3, -2, -1], [3, -3, 0], [3.0, 3.1, 2.9]):
|
|
|
|
|
... find_max(nums) == max(nums)
|
|
|
|
|
True
|
|
|
|
|
True
|
|
|
|
|
True
|
|
|
|
|
True
|
|
|
|
|
"""
|
2019-10-28 12:50:36 +00:00
|
|
|
max_num = nums[0]
|
2018-10-22 18:36:08 +00:00
|
|
|
for x in nums:
|
2019-10-28 12:50:36 +00:00
|
|
|
if x > max_num:
|
|
|
|
|
max_num = x
|
|
|
|
|
return max_num
|
2018-10-22 18:42:08 +00:00
|
|
|
|
2019-10-05 05:14:13 +00:00
|
|
|
|
2018-10-22 18:42:08 +00:00
|
|
|
def main():
|
2019-10-28 08:14:53 +00:00
|
|
|
print(find_max([2, 4, 9, 7, 19, 94, 5])) # 94
|
2019-10-05 05:14:13 +00:00
|
|
|
|
2018-10-22 18:42:08 +00:00
|
|
|
|
2019-10-05 05:14:13 +00:00
|
|
|
if __name__ == "__main__":
|
|
|
|
|
main()
|
