LeetCode #405 - Convert a Number to Hexadecimal

题目描述:

Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.

Note:

  1. All letters in hexadecimal (a-f) must be in lowercase.
  2. 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.
  3. The given number is guaranteed to fit within the range of a 32-bit signed integer.
  4. 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"

将int数转化为十六进制,如果只有正数就比较简单,而对于负数,计算机使用补码进行存储,也就是负数的原码求反码再加一,求原码直接取相反数,求补码和0xFFFFFFFF求异或即可。

class Solution {
public:
    string toHex(int num) {
        if(num==0) return "0";
        string hexChar="0123456789abcdef";
        unsigned int x;
        unsigned int mask=0xFFFFFFFF;
        if(num<0) x=((-num)^mask)+1;
        else x=num;
        
        string result;
        while(x>0)
        {
            result=hexChar[x%16]+result;
            x/=16;
        }
        return result;
    }
};

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值