Problem
Given an integer num, return a string representing its hexadecimal representation. For negative integers, two’s complement method is used.
All the letters in the answer string should be lowercase characters, and there should not be any leading zeros in the answer except for the zero itself.
Note: You are not allowed to use any built-in library method to directly solve this problem.
Example 1:
Input: num = 26
Output: "1a"
Example 2:
Input: num = -1
Output: "ffffffff"
Constraints:
-2^31 <= num <= 2^31 - 1
Solution
class Solution {
public String toHex(int num) {
if (num == 0) {
return "0";
}
StringBuilder sb = new StringBuilder();
int x;
while (num != 0) {
x = num & 0xf;
if (x < 10) {
sb.append(x);
} else {
sb.append((char) (x + 87));
}
num = num >>> 4;
}
return sb.reverse().toString();
}
}
Explain:
nope.
Complexity:
- Time complexity : O(n).
- Space complexity : O(n).