码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] 405. Convert a Number to Hexadecimal_Easy tag: Bit Manipulation

时间:2018-08-28 10:34:39      阅读:126      评论:0      收藏:0      [点我收藏+]

标签:ISE   which   class   amp   fir   form   mod   not   ant   

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"

 

Code    T: O(1)

class Solution:
    def toHex(self, num):
        ans, d = "", {10:a, 11:b, 12:c, 13:d, 14:e, 15:f}
        if num == 0:
            return "0"
        if num < 0:
            num = 2**32 + num
        while num > 0:
            tem, rem = divmod(num, 16)
            if rem > 9:
                ans += d[rem]
            else:
                ans += str(rem)
            num = tem
        return ans[::-1]

 

[LeetCode] 405. Convert a Number to Hexadecimal_Easy tag: Bit Manipulation

标签:ISE   which   class   amp   fir   form   mod   not   ant   

原文地址:https://www.cnblogs.com/Johnsonxiong/p/9545947.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!