一、题目
Given an 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.
Example 1:
Input: num = 26
Output: “1a”
Example 2:
Input: num = -1
Output: “ffffffff”
Constraints:文章来源：https://www.toymoban.com/news/detail-827024.html
-231 <= num <= 231 - 1文章来源地址https://www.toymoban.com/news/detail-827024.html
二、题解
class Solution {
public:
string toHex(int num) {
if(num == 0) return "0";
string res = "";
while(num != 0){
int u = num & 15;
char c = u + '0';
if(u >= 10) c = (u - 10 + 'a');
res += c;
//逻辑右移
num = (unsigned int)num >> 4;
}
reverse(res.begin(),res.end());
return res;
}
};
到了这里，关于LeetCode405. Convert a Number to Hexadecimal的文章就介绍完了。如果您还想了解更多内容，请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章，希望大家以后多多支持TOY模板网！
