Largest Number From Array Of Integers
Arrange non-negative integers to form largest number. Compare concatenated results using custom comparator. Edge case: if largest num is 0, return '0'. Time complexity: O(n log n) + O(n).
179. Largest Number Difficulty: Medium Topics: Array, String, Greedy, Sorting 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 Solution: We need to compare numbers based on their concatenated results. For two numbers a and b, we compare ab (a concatenated with b) and ba (b concaten...