首页 > itarticle > [leetcode] problem 405 – convert a number to hexadecimal

[leetcode] problem 405 – convert a number to hexadecimal

admin 11月 13, 2020 0

Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.

Note

All letters in hexadecimal (a-f) must be in lowercase.
The hexadecimal string must not contain extra leading 0s. If the number is zero, it is represented by a single zero character ‘0’; otherwise, the first character in the hexadecimal string will not be the zero character.
The given number is guaranteed to fit within the range of a 32-bit signed integer.
You must not use any method provided by the library which converts/formats the number to hex directly.

Example

No.1

Input:
26

Output:
“1a”

No.2

Input:
-1

Output:
“ffffffff”

Code

public String (int num) {
    StringBuilder sb = new StringBuilder();
    String str = "0123456789abcdef";
    int count = 0;

    while (num != 0 && count < 8) {
        char ch = str.charAt(num & 0xf);
        sb.append(ch);
        num >>= 4;
        count++;
    }

    return sb.length() == 0 ? "0" : sb.reverse().toString();
}