|
| 1 | +import heapq |
| 2 | + |
| 3 | +def largest_integer(num): |
| 4 | + |
| 5 | + # Convert the number into a list of digits |
| 6 | + digits = [int(d) for d in str(num)] |
| 7 | + |
| 8 | + # Create two max_heaps for odd and even digits |
| 9 | + odd_heap = [] |
| 10 | + even_heap = [] |
| 11 | + |
| 12 | + # Fill the heaps |
| 13 | + for d in digits: |
| 14 | + # Even |
| 15 | + if d % 2 == 0: |
| 16 | + heapq.heappush(even_heap, -d) |
| 17 | + # Odd |
| 18 | + else: |
| 19 | + heapq.heappush(odd_heap, -d) |
| 20 | + |
| 21 | + # Construct result |
| 22 | + result = [] |
| 23 | + |
| 24 | + for d in digits: |
| 25 | + if d % 2 == 0: |
| 26 | + largest_even = -heapq.heappop(even_heap) |
| 27 | + result.append(largest_even) |
| 28 | + else: |
| 29 | + largest_odd = -heapq.heappop(odd_heap) |
| 30 | + result.append(largest_odd) |
| 31 | + |
| 32 | + # Join the result list into a single number (integer) |
| 33 | + return int(''.join(map(str, result))) |
| 34 | + |
| 35 | + |
| 36 | + |
| 37 | +# Time Complexity = O(nlogn) |
| 38 | +# Space Complexity = O(n) |
| 39 | + |
| 40 | + |
| 41 | + |
| 42 | +############################################################### |
| 43 | + |
| 44 | + |
| 45 | + |
| 46 | +# Driver Code |
| 47 | +def main(): |
| 48 | + test_cases = [1234, 65875, 4321, 2468, 98123] |
| 49 | + for num in test_cases: |
| 50 | + print("\tInput number:", num) |
| 51 | + print("\n\tOutput number:", largest_integer(num)) |
| 52 | + print("-"*100) |
| 53 | + |
| 54 | +if __name__ == "__main__": |
| 55 | + main() |
| 56 | + |
| 57 | + |
0 commit comments