Convert a Number to Hexadecimal — LeetCode 405 Python Solution
- Problem
- #405
- Pattern
- Bit Manipulation
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given a 32-bit integer num, return a string representing its hexadecimal representation. For negative integers, two’s complement method is used.
Example
- Input
- num = 26
- Output
- "1a"
Python solution
class Solution:
def toHex(self, num: int) -> str:
if num == 0:
return '0'
chars = '0123456789abcdef'
s = []
for i in range(7, -1, -1):
x = (num >> (4 * i)) & 0xF
if s or x != 0:
s.append(chars[x])
return ''.join(s)Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(1) auxiliary |
Pattern: Bit Manipulation
Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 405. Convert a Number to Hexadecimal is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Bit Manipulation.
The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 405. Convert a Number to Hexadecimal?
- LeetCode 405. Convert a Number to Hexadecimal is rated Easy on LeetCode.
- What is the time complexity of LeetCode 405. Convert a Number to Hexadecimal?
- The Python solution on this page runs in O(n).
- What is the space complexity of LeetCode 405. Convert a Number to Hexadecimal?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 405. Convert a Number to Hexadecimal cover?
- LeetCode 405. Convert a Number to Hexadecimal is tagged Bit Manipulation, Math and String on LeetCode.