Exchange Argument

Table of Contents

• 2895. Minimum Processing Time (Medium)
• 3457. Eat Pizzas! (Medium)
• 1665. Minimum Initial Energy to Finish Tasks (Hard)
• 3273. Minimum Amount of Damage Dealt to Bob (Hard)
• 2136. Earliest Possible Day of Full Bloom (Hard)
• 179. Largest Number (Medium)
• 3309. Maximum Possible Number by Binary Concatenation (Medium)

2895. Minimum Processing Time

• LeetCode | LeetCode CH (Medium)

• Tags: array, greedy, sorting

3457. Eat Pizzas!

• LeetCode | LeetCode CH (Medium)

• Tags: array, greedy, sorting

1665. Minimum Initial Energy to Finish Tasks

• LeetCode | LeetCode CH (Hard)

• Tags: array, greedy, sorting

3273. Minimum Amount of Damage Dealt to Bob

• LeetCode | LeetCode CH (Hard)

• Tags: array, greedy, sorting

2136. Earliest Possible Day of Full Bloom

• LeetCode | LeetCode CH (Hard)

• Tags: array, greedy, sorting

179. Largest Number

• LeetCode | LeetCode CH (Medium)

• Tags: array, string, greedy, sorting

179. Largest Number - Python Solution

from functools import cmp_to_key
from typing import List


# Greedy
def largestNumber(nums: List[int]) -> str:
    strs = map(str, nums)

    def cmp(a, b):
        if a + b == b + a:
            return 0
        elif a + b > b + a:
            return 1
        else:
            return -1

    strs = sorted(strs, key=cmp_to_key(cmp), reverse=True)

    return "".join(strs) if strs[0] != "0" else "0"


nums = [3, 30, 34, 5, 9]
print(largestNumber(nums))  # 9534330

3309. Maximum Possible Number by Binary Concatenation

• LeetCode | LeetCode CH (Medium)

• Tags: array, bit manipulation, enumeration

Comments