首页 > 代码库 > [leetcode-405-Convert a Number to Hexadecimal]
[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:
- All letters in hexadecimal (
a-f
) must be in lowercase. - The hexadecimal string must not contain extra leading
0
s. 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"
思路:
参考了牛人代码。位操作,将num的后4位 与 oxf 相与,这么做的好处是,不管负数还是正数都可以这样处理。
学习了。。
const string HEX = "0123456789abcdef"; class Solution { public: string toHex(int num) { if (num == 0) return "0"; string result; int count = 0; while (num && count++ < 8) { result = HEX[(num & 0xf)] + result; num >>= 4; } return result; } };
参考:
https://discuss.leetcode.com/topic/60431/concise-c-solution
[leetcode-405-Convert a Number to Hexadecimal]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。