LeetCode405. Convert a Number to Hexadecimal

本文主要是介绍LeetCode405. Convert a Number to Hexadecimal，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

一、题目

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:

-231 <= num <= 231 - 1

二、题解

class Solution {
public:string toHex(int num) {if(num == 0) return "0";string res = "";while(num != 0){int u = num & 15;char c = u + '0';if(u >= 10) c = (u - 10 + 'a');res += c;//逻辑右移num = (unsigned int)num >> 4;}reverse(res.begin(),res.end());return res;}
};

这篇关于LeetCode405. Convert a Number to Hexadecimal的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---