关闭

Leetcode Convert a Number to Hexadecimal 405

标签: leetcode
126人阅读 评论(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 1:

Input:
26

Output:
“1a”
Example 2:

Input:
-1

Output:
“ffffffff”

题目链接

主要考虑负数的情况,这里使用逻辑移位

class Solution {
public:
    string toHex(int num) {
        if(num==0) return "0";

        string trans[]={"0","1","2","3","4","5","6","7","8","9","a","b","c","d","e","f"};

        string ans;

        while(num){
            ans=trans[num & 0xf]+ans;
            num=(unsigned)num >> 4;
        }

        return ans;
    }
};
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:66172次
    • 积分:2264
    • 等级:
    • 排名:第16595名
    • 原创:165篇
    • 转载:12篇
    • 译文:0篇
    • 评论:5条
    最新评论