Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two\u2019s complement method is used.<\/p>\n\n\n\n
Note:<\/p>\n\n\n\n
All letters in hexadecimal (a-f) must be in lowercase.
\nThe 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.
\nThe given number is guaranteed to fit within the range of a 32-bit signed integer.
\nYou must not use any method provided by the library which converts\/formats the number to hex directly.
\nExample 1:<\/p>\n\n\n\n
Input:
\n26<\/p>\n\n\n\n
Output:
\n“1a”
\nExample 2:<\/p>\n\n\n\n
Input:
\n-1<\/p>\n\n\n\n
Output:
“ffffffff”<\/p>\n\n\n\n
if input is negative, add 2^32 to it (e.g. set the highest bit to 1)
while num is non zero, mod it by 16 and prepend the remainder to ans string, then divide num by 16.<\/p>\n\n\n\n
Time complexity: O(logn)
Space complexity: O(logn)<\/p>\n\n\n\n
\n\/\/ Author: Huahua\nconstexpr char kHex[] = \"0123456789abcdef\";\n\nclass Solution {\npublic:\n string toHex(int num) {\n if (num == 0) return \"0\";\n long t = num < 0 ? (1LL << 32) + num : num;\n string ans; \n while (t) {\n ans = kHex[t % 16] + ans;\n t \/= 16;\n }\n return ans;\n }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two\u2019s complement method is used. Note: All letters in hexadecimal (a-f)…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[48],"tags":[222,10,179],"class_list":["post-5926","post","type-post","status-publish","format-standard","hentry","category-simulation","tag-easy","tag-hex","tag-simulation","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/5926","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=5926"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/5926\/revisions"}],"predecessor-version":[{"id":5928,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/5926\/revisions\/5928"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=5926"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=5926"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=5926"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}