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:

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"

方法1:

思路：

由于num本来的储存形式就是二进制，可以直接和0xf, 也就是0000000f = 0000 0000 0000 0000 0000 0000 0000 1111相与，来提取后4位，也就是对16取余的结果，将这个结果依次加入result。每一次num >>= 4，相当于整除16，直到取满8次或者num为0。最后将结果reverse并返回。

因为负数以补码的形式存储，不需要特别处理。但是要记录一个count，否则会造成overflow。

class Solution {
public:
    string toHex(int num) {
        string hex = "0123456789abcdef", result;
        int count = 0;
        while (num && count++ < 8) {
            int val = num & 0xf;
            result += hex[val];
            num >>= 4;
        }
        reverse(result.begin(), result.end());
        return result;
    }
};