[LeetCode] 405.Convert a Number to Hexadecimal

[LeetCode] 405.Convert a Number to Hexadecimal

• 题目描述
• 解题思路
• 实验代码

---

题目描述

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

Note:
1. All letters in hexadecimal (a-f) must be in lowercase.
2. 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.
3. The given number is guaranteed to fit within the range of a 32-bit signed integer.
4. You must not use any method provided by the library which converts/formats the number to hex directly.

Example 1:
Input:
26

Output:
“1a”

Example 2:
Input:
-1

Output:
“ffffffff”

解题思路

这道题就是普通的十进制转十六进制，只要清楚了解十进制数与十六进制数之间的转换规则就能轻松解决这个问题，当然也可以使用一些函数比如我这里用的Java中的toHexString()函数解决问题。

实验代码

class Solution {
    public String toHex(int num) {
        String s = Integer.toHexString(num);
        return s;
    }
}