물음표 살인마의 개발블로그

알고리즘 문제/Leetcode

179. Largest Number

BEstyle 2022. 12. 13. 13:13

Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.

Since the result may be very large, so you need to return a string instead of an integer.

 

Example 1:

Input: nums = [10,2]
Output: "210"

Example 2:

Input: nums = [3,30,34,5,9]
Output: "9534330"

 

Constraints:

  • 1 <= nums.length <= 100
  • 0 <= nums[i] <= 109

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

'알고리즘 문제 > Leetcode' 카테고리의 다른 글

66. Plus One  (0) 2022.12.20
280. Wiggle Sort  (0) 2022.12.14
134. Gas Station  (0) 2022.12.13
122. Best Time to Buy and Sell Stock II  (1) 2022.12.13
55. Jump Game  (0) 2022.12.12