package com.fishercoder.solutions;

/**
 * 405. Convert a Number to Hexadecimal

 Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.

 Note:

 All letters in hexadecimal (a-f) must be in lowercase.
 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.
 The given number is guaranteed to fit within the range of a 32-bit signed integer.
 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"

 */
public class _405 {

    public String toHex(int num) {
        char[] hexChars = new char[]{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'};
        String result = "";
        while (num != 0) {
            result = hexChars[(num & 15)] + result;
            num >>>= 4;
        }
        return result.isEmpty() ? "0" : result;
    }

}

@@ -787,16 +787,56 @@
 _405 %7B%0A%0A
+    public static class Solution1 %7B%0A    
     publ
@@ -870,16 +870,20 @@
         
+   
+ 
 char%5B%5D h
@@ -891,16 +891,32 @@
 xChars =
+%0A               
  new cha
@@ -918,16 +918,17 @@
 w char%5B%5D
+ 
 %7B'0', '1
@@ -989,16 +989,36 @@
 c', 'd',
+%0A                   
  'e', 'f
@@ -1021,16 +1021,20 @@
 , 'f'%7D;%0A
+    
         
@@ -1061,16 +1061,20 @@
         
+ 
+   
 while (n
@@ -1080,24 +1080,28 @@
 num != 0) %7B%0A
+    
             
@@ -1152,16 +1152,20 @@
         
+    
 num %3E%3E%3E=
@@ -1176,18 +1176,26 @@
         
+   
+ 
 %7D%0A
+    
         
@@ -1238,13 +1238,22 @@
 lt;%0A    
+    %7D%0A    
 %7D
-%0A
 %0A%7D%0A

refactor 405