-
Notifications
You must be signed in to change notification settings - Fork 40
/
Copy pathConvertANumberToHexadecimal.js
52 lines (48 loc) · 1.26 KB
/
ConvertANumberToHexadecimal.js
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
// Source : https://leetcode.com/problems/convert-a-number-to-hexadecimal
// Author : Dean Shi
// Date : 2017-09-09
/***************************************************************************************
*
* 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"
*
*
***************************************************************************************/
/**
* @param {number} num
* @return {string}
*/
var toHex = function(num) {
const hex = '0123456789abcdef'
let rest, result = ''
do {
result = hex[num & 15] + result
} while (num >>>= 4)
return result
};