【每日一题20220325】最大差值

兴趣爱好交流 每日一题
1

:mage:‍ 给定一个数字列表nums，请编写一个函数，计算出其中的最大值和最小值之间的差值。数字中可能包含负数，不存在重复。

示例：
输入： [1, 3, 2, -4]
输出：7
解释：因为最大值是3，最小值是-4，3-(-4)=7。

题目难度：简单
题目来源：CodeWars：max diff - easy

def solution(nums: list) -> int:
    # your code here

assert solution([-0, 1, 2, -3, 4, 5, -6]) == 11
assert solution([0, 1, 2, 3, 4, 5, 6]) == 6
assert solution([16]) == 0
2 
def solution(nums: list) -> int:
    return max(nums)-min(nums) if nums else 0
3

这个有点太简单了 :joy: :rofl:

4 
def solution(nums: list) -> int:
    # your code here
    nums = sorted(nums)
    return (nums[-1] - nums[0]) if nums else 0


assert solution([-0, 1, 2, -3, 4, 5, -6]) == 11
assert solution([0, 1, 2, 3, 4, 5, 6]) == 6
assert solution([16]) == 0
5 
def solution(nums: list) -> int:
    return max(nums) - min(nums)


assert solution([-0, 1, 2, -3, 4, 5, -6]) == 11
assert solution([0, 1, 2, 3, 4, 5, 6]) == 6
assert solution([16]) == 0
6 

def solution(nums: list) -> int:
    return max(nums)-min(nums)
7 
def solution(nums: list) -> int:
      return max(nums) - min(nums)
8 
    def solution(nums: list) -> int:
        min = nums[0]
        max = nums[0]
        for i in nums:
            if i < min:min = i
            if i > max:max = i
        print(-min+max)
        return -min+max
9 
def solution(nums: list) -> int:
    return max(nums)-min(nums)

assert solution([-0, 1, 2, -3, 4, 5, -6]) == 11
assert solution([0, 1, 2, 3, 4, 5, 6]) == 6
assert solution([16]) == 0