Leetcode 405. Convert a Number to Hexadecimal

Problem

Given a 32-bit integer 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.

Algorithm

Compute the remainders sequentially and change to hexadecimal chars.

Code

class Solution:
    def toHex(self, num: int) -> str:
        if num == 0:
            return "0"
        
        he = "0123456789abcdef";
        if num < 0:
            num += 2 ** 32
        
        ans = ""
        while num > 0:
            ans = he[num % 16] + ans
            num //= 16

        return ans