• 40.7%

https://leetcode.com/problems/convert-a-number-to-hexadecimal/?tab=Description

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.

https://discuss.leetcode.com/topic/60365/simple-java-solution-with-comment

Simple Java solution with comment

https://discuss.leetcode.com/topic/60365/simple-java-solution-with-comment/2

My corresponding C++ code. I must add result.size()<8 in the while condition, or it will loop forever with a negative input.

https://discuss.leetcode.com/topic/60365/simple-java-solution-with-comment/3

StringBuilder may be used here.

https://discuss.leetcode.com/topic/60431/concise-c-solution

Concise C++ Solution

https://discuss.leetcode.com/topic/60929/1-liner-in-python

1-liner in Python

https://discuss.leetcode.com/topic/61846/easy-10-line-python-solution-with-inline-explanation

easy 10-line python solution with inline explanation