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 405 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 405 # by problem number
lcpy gen -s convert_a_number_to_hexadecimal # by problem name
num, return a string representing its hexadecimal representation. For negative integers, two’s complement method is used.
All the letters in the answer string should be lowercase characters, and there should not be any leading zeros in the answer except for the zero itself.
Note: You are not allowed to use any built-in library method to directly solve this problem.
Input: num = 26
Output: "1a"
Input: num = -1
Output: "ffffffff"
class Solution:
# Time: O(1) - at most 8 hex digits for a 32-bit integer
# Space: O(1) - output string holds at most 8 characters
def to_hex(self, num: int) -> str:
value = num & 0xFFFFFFFF
digits = "0123456789abcdef"
if value == 0:
return "0"
out: list[str] = []
while value:
out.append(digits[value & 0xF])
value >>= 4
return "".join(reversed(out))
| Time | Space |
|---|---|
| O(1) - at most 8 hex digits for a 32-bit integer | O(1) - output string holds at most 8 characters |