January 5, 2024
Моя первая статья
nums = [4, 8, 15, 16, 3, 14, 15, 192, 168, 1992, 37, 256, 98, 101, 273, 7787, 918, 39, 1098, 222, 69, 96, 5234, 777]
new_nums = []
for i in nums: if i % 2 == 1: new_nums.append(i * 2) else: new_nums.append(i**2)
print(new_nums)res = []
for i in new_nums: if i % 24 != 0: res.append(i)print(res)
class LargerNumKey(str): def __lt__(x, y): return x+y < y+x class Solution: def largestNumber(self, nums): largest_num = ''.join(sorted(map(str, nums), key=LargerNumKey)) return '0' if largest_num[0] == '0' else largest_num resu = Solution()
print(resu.largestNumber(res))