leetcode part1--十六进制的转换

最新推荐文章于 2023-01-19 14:07:02 发布

Evabook

最新推荐文章于 2023-01-19 14:07:02 发布

阅读量481

点赞数 1

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/Evabook/article/details/90450197

leetcode 专栏收录该内容

2 篇文章

订阅专栏

博客围绕将整数转换为十六进制的算法展开。指出若单纯推算需考虑0、负数与正数区别，可利用数据在计算机中的存储形式，每次读取后四位并按规则转换，再右移数据直至读完。还给出了Java实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目： 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.

解决方法：如果单纯的推算十六进制的方法来做，需要考虑0，负数与正数的区别
但可以利用数据在计算机中的存储形式，每次读取存储的后四位，并按照0-9，a-z的形式读取即可。然后再将数据右移，重复此操作直至所有数据均读取。
public String toHex(int num) {
String s="";
do{
int rem = num & 15;
if(rem < 10)
s=rem+s;
else
{
s=(char)(rem-10+‘a’)+s;
}
num >>>= 4;
}while(num!=0);
return s;
}