405. Convert a Number to Hexadecimal

最新推荐文章于 2024-02-17 11:42:33 发布

myfwjy

最新推荐文章于 2024-02-17 11:42:33 发布

阅读量214

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/myfwjy/article/details/52923280

版权

LeetCode 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

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"

思路：

正数转十六进制比较容易，负数的十六进制是补码，也就是值取反加一，所以用2^32+负数转换成十六进制就是所求的值，但是int型的正数最大限度是2^31-1，所以最后一位在处理的时候要加上8

public class Solution {
    public String toHex(int num) {
        StringBuffer buffer = new StringBuffer();
	if (num == 0)
		return String.valueOf(num);
	int r = 0, time = 0;
	int toHex = num;
	if (num < 0) {
		int base = (int) (Math.pow(2, 31) - 1);
		toHex = (toHex + base) + 1;
	}
	while (toHex > 0 || (num < 0 && time < 8)) {
		r = toHex % 16;
		toHex /= 16;
		if(time == 7 && num < 0){
			// int最多到2^32-1所以针对负数的最高位要加上一个8补足
			r += 8;
		}
		if (r >= 10) {
			buffer.insert(0, (char) ('a' + r - 10));
		} else {
			buffer.insert(0, Integer.toString(r));
		}
		time++;
	}
	return buffer.toString();
    }
}