GitHub - w5678/leetcode-2021: Learn and Share
class Solution:
def maximumDifference(self, nums: list[int]) -> int:
maxdiff = -1
for i in range(1, len(nums)):
for j in range(0, i):
if nums[i] > nums[j]:
maxdiff = max(maxdiff, nums[i] - nums[j])
return maxdiff
思路:
使用暴力求解法