# 输入: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)
文章目录 前言ABCDEFGH 前言
仅个人回忆,不保证正确性 貌似都是典题,针对python的长代码模拟题也没有,一小时速通了,希望不要翻车。 更新:B、G翻车了。。
A 答案:103
B 应该是按长度排序,然后…
论文:Transfusion: Predict the Next Token and Diffuse Images with One Multi-Modal Model
地址:https://arxiv.org/abs/2408.11039
类型:理解与生成 Transfusion模型是一种将Transformer和Diffusion模型融合的多模态模型,旨…