mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
21 lines
914 B
HTML
21 lines
914 B
HTML
<p>Given an integer <code>num</code>, return <em>a string representing its hexadecimal representation</em>. For negative integers, <a href="https://en.wikipedia.org/wiki/Two%27s_complement" target="_blank">two’s complement</a> method is used.</p>
|
|
|
|
<p>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.</p>
|
|
|
|
<p><strong>Note: </strong>You are not allowed to use any built-in library method to directly solve this problem.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> num = 26
|
|
<strong>Output:</strong> "1a"
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> num = -1
|
|
<strong>Output:</strong> "ffffffff"
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>-2<sup>31</sup> <= num <= 2<sup>31</sup> - 1</code></li>
|
|
</ul>
|