Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 179 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 179 # by problem number
lcpy gen -s largest_number # by problem name
nums, arrange them such that they form the largest number and return it.
Since the result may be very large, you need to return a string instead of an integer.
Input: nums = [10,2]
Output: "210"
Input: nums = [3,30,34,5,9]
Output: "9534330"
from functools import cmp_to_key
class Solution:
# Time: O(k * n log n) — comparator does string concat of length k
# Space: O(n * k) for the string keys
def largest_number(self, nums: list[int]) -> str:
strs = [str(n) for n in nums]
def compare(a: str, b: str) -> int:
if a + b > b + a:
return -1
if a + b < b + a:
return 1
return 0
strs.sort(key=cmp_to_key(compare))
result = "".join(strs)
# Leading zero means every value was zero
return "0" if result[0] == "0" else result
| Time | Space |
|---|---|
| O(k * n log n) — comparator does string concat of length k | O(n * k) for the string keys |