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.

题意：将一个十进制数转化成16进制。

题目很简单，如果要转化的树是正数，那么用它除16取余即可。对于负数，先转化成二进制补码，然后在进行转化。

下面贴代码：

public class Solution {
    public String toHex(int num) {
        if(num == 0) return "0";
        String s = "";
        HashMap<Integer,String> h = new HashMap<>();
        h.put(0,"0");
        h.put(1,"1");
        h.put(2,"2");
        h.put(3,"3");
        h.put(4,"4");
        h.put(5,"5");
        h.put(6,"6");
        h.put(7,"7");
        h.put(8,"8");
        h.put(9,"9");
        h.put(10,"a");
        h.put(11,"b");
        h.put(12,"c");
        h.put(13,"d");
        h.put(14,"e");
        h.put(15,"f");
        if(num < 0){
            String ss = Integer.toBinaryString(num);
            while(ss.length() != 0){
                //System.out.println(ss);
                int n = (ss.charAt(0)-'0')*8+(ss.charAt(1)-'0')*4+(ss.charAt(2)-'0')*2+(ss.charAt(3)-'0');
                s = s+h.get(n);
                ss = ss.substring(4);
            }
        }else{
            while(num != 0){
                s = h.get(num%16) + s;
                num = num/16;
            }
        }
        return s;
    }
}

事实上，这道题最直接最简单的方法是使用位运算符来进行转化，我们只要把需要转化的数和15进行&运算，然后再右移4位，重复上面过程即可。

下面贴代码：

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