python lt与gt 使用初体验，是出bug了吗？

最新推荐文章于 2024-09-22 21:10:42 发布

HxShine

最新推荐文章于 2024-09-22 21:10:42 发布

阅读量442

点赞数

分类专栏： python

本文链接：https://blog.csdn.net/qq_16949707/article/details/110601125

版权

python 专栏收录该内容

78 篇文章 3 订阅

订阅专栏

1. 代码

class LargerNumKey1(str):
    # https://blog.csdn.net/LaoYuanPython/article/details/95042104
    def __lt__(x, y):
        return x + y > y + x

class Solution1:
    def largestNumber(self, nums):
        print("input:nums:",nums)
        largest_num = ''.join(sorted(map(str, nums), key=LargerNumKey1))
        print("largest_num:", largest_num)
        return '0' if largest_num[0] == '0' else largest_num

nums = [2343,2343,345,6546,654]
s = Solution1()
print(s.largestNumber(nums))

print("="*10)

class LargerNumKey2(str):
    # https://blog.csdn.net/LaoYuanPython/article/details/95042104
    def __lt__(x, y):
        return x + y < y + x

class Solution2:
    def largestNumber(self, nums):
        print("input:nums:",nums)
        largest_num = ''.join(sorted(map(str, nums), key=LargerNumKey2))
        print("largest_num:", largest_num)
        return '0' if largest_num[0] == '0' else largest_num

nums = [2343,2343,345,6546,654]
s = Solution2()
print(s.largestNumber(nums))


print("="*10)

class LargerNumKey3(str):
    # https://blog.csdn.net/LaoYuanPython/article/details/95042104
    def __gt__(x, y):
        return x + y < y + x

class Solution3:
    def largestNumber(self, nums):
        print("input:nums:",nums)
        largest_num = ''.join(sorted(map(str, nums), key=LargerNumKey3))
        print("largest_num:", largest_num)
        return '0' if largest_num[0] == '0' else largest_num

nums = [2343,2343,345,6546,654]
s = Solution3()
print(s.largestNumber(nums))


print("="*10)

class LargerNumKey4(str):
    # https://blog.csdn.net/LaoYuanPython/article/details/95042104
    def __gt__(x, y):
        return x + y > y + x

class Solution4:
    def largestNumber(self, nums):
        print("input:nums:",nums)
        largest_num = ''.join(sorted(map(str, nums), key=LargerNumKey4))
        print("largest_num:", largest_num)
        return '0' if largest_num[0] == '0' else largest_num

nums = [2343,2343,345,6546,654]
s = Solution4()
print(s.largestNumber(nums))

print("="*10)

print("后面几种为啥都不变了啊")

2. 输出


input:nums: [2343, 2343, 345, 6546, 654]
largest_num: 654665434523432343
654665434523432343
==========
input:nums: [2343, 2343, 345, 6546, 654]
largest_num: 234323433456546546
234323433456546546
==========
input:nums: [2343, 2343, 345, 6546, 654]
largest_num: 234323433456546546
234323433456546546
==========
input:nums: [2343, 2343, 345, 6546, 654]
largest_num: 234323433456546546
234323433456546546
==========
后面几种为啥都不变了啊

Process finished with exit code 0