forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ConvertANumberToHexadecimal.cpp
56 lines (50 loc) · 1.42 KB
/
ConvertANumberToHexadecimal.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
// Source : https://leetcode.com/problems/convert-a-number-to-hexadecimal/
// Author : Hao Chen
// Date : 2016-11-12
/***************************************************************************************
*
* 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";
unsigned int x = num;
string result;
for(;x > 0; x/=16) {
int n = x % 16;
char c;
if (n < 10) c = n + '0';
else c = 'a' + n - 10 ;
result = c + result;
}
return result;
}
};