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:
1 2 3 4 5
Input: 26
Output: "1a"
Example 2:
1 2 3 4 5
Input: -1
Output: "ffffffff"
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
publicclassSolution { public String toHex(int num) { Stringresult=""; for (inti=0; num != 0 && i < 8; i++) { intx= num & 0xf; if (x >= 10) { chara= (char) ('a' + x - 10); result = a + result; } else { result = x + result; } num = num >> 4; } return result.isEmpty() ? "0" : result; } }