寻找最大美丽数

# 输入：nums1 = [4,2,1,5,3], nums2 = [10,20,30,40,50], k = 2
# 输出：[80,30,0,80,50]
import random
class Solution:
    def findMaxSum(self, nums1, nums2, k):
        hash_table = []
        sum1 = 0
        data = []
        print('*'*31,'\n','\t数据')
        for key,values in enumerate(nums1):
            data2 = []
            if values in hash_table:
                continue
            for key2,values2 in enumerate(nums1):
                if values2<values:
                    data2.append(key2)
            if 0 == len(data2) and values not in hash_table:
                hash_table.append(values)
            print(f'当i等于 => {key} 小于的值有 {data2}') if len(data2) > 0 else 1
            data.append(data2)  if len(data2) > 0 else 1
        print('*'*31,'\n')
        for i in data:
            print(data,end='\n\n\n')

if '__main__' == __name__:
    nums1 = [random.randint(1,5) for i in range(50)]
    nums2 = [10, 20, 30, 40, 50]
    k = 2
    s = Solution()
    s.findMaxSum(nums1=nums1,nums2=nums2,k=k)