微博地址url(id)與mid的相互轉換 Java版

原理:

新浪微博的URL都是如:http://weibo.com/2480531040/z8ElgBLeQ這樣三部分.

第一部分(綠色部分)為新浪微博的域名,第二部分(紅色部分)為博主Uid,第三部分(藍色)為一串貌似隨機的字符串.

如果通過方法能計算出藍色字串與返回的數組里的對應關系則好解決多了.

首先分組藍色字串 ,從后往前4個字符一組，得到以下三組字符：
z
8Elg
BLeQ

將它們分別轉換成62進制的數值則為 35, 2061702, 8999724  將它們組合起來就是一串 3520617028999724 類似這樣的字串

通過發現返回的二維數組里有個 [mid]的字段,其返回結果為 3520617028999724.剛好是對應的.

http://weibo.com/aj/v6/mblog/info/big?ajwvr=6&id=3919740416635598&page=1

package step0;


/**
 * 
    * @ClassName: Mid2IdUtil Java版
    * @Description:  新浪uid轉url (id轉mid)
    * @author zeze
    * @date 2016年4月10日 上午10:49:40 
    *
 */
public class Id2MidUtil {
    public static void main(String[] args) {
        System.out.println(Uid2Mid("Aw8Wrzaes"));
        System.out.println(Mid2Uid("3676608718380816"));//Mid2Id
    }
    private static String[] str62keys = { "0", "1", "2", "3", "4", "5", "6",
            "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j",
            "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w",
            "x", "y", "z", "A", "B", "C", "D", "E", "F", "G", "H", "I", "J",
            "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W",
            "X", "Y", "Z" };

    public static String IntToEnode62(Integer int10) {
        String s62 = "";
        int r = 0;
        while (int10 != 0) {
            r = int10 % 62;
            s62 = str62keys[r] + s62;
            int10 = (int) Math.floor(int10 / 62.0);
        }
        return s62;
    }
    
     //62進制轉成10進制
    public static String Str62toInt(String str62)
    {
        long i64 = 0;
        for (int i = 0; i < str62.length(); i++)
        {
            long Vi = (long)Math.pow(62, (str62.length() - i - 1));
            String t = str62.substring(i,i+1);
           
            i64 += Vi * findindex(t);
        }
       // System.out.println(i64);
        return Long.toString(i64);
    }
    
    public static int findindex(String t)
    {
        int index=0;
        for(int i=0;i<str62keys.length;i++)
        {
            if(str62keys[i].equals(t)){
                index=i;
                break;
            }
        }
        return index;
    }
 
     public static String Uid2Mid(String mid)
        {
            String id = "";
            for (int i = mid.length() - 4; i > -4; i = i - 4) //從最后往前以4字節為一組讀取URL字符
            {
                int offset1 = i < 0 ? 0 : i;
                int len = i < 0 ? mid.length() % 4 : 4;
                
                String str = mid.substring(offset1, offset1+len);
               // System.out.println(offset1+" "+len+" "+str);
                
                str = Str62toInt(str);
                
                if (offset1 > 0) //若不是第一組，則不足7位補0
                {
                    while (str.length() < 7)
                    {
                        str = "0" + str;
                    }
                }
                id = str + id;
            }

            return id;
        }
    
    
    public static String Mid2Uid(String str10) {
        String mid = "";
        int count = 1 ;
        for (int i = str10.length() - 7; i > -7; i = i - 7) // 從最后往前以7字節為一組讀取字符
        {
            int offset = i < 0 ? 0 : i;
            int len = i < 0 ? str10.length() % 7 : 7;
            String temp = str10.substring(offset, offset + len);
            String url =IntToEnode62(Integer.valueOf(temp));
            if(count!=3){//z xghm uXym 生成的鏈接從右往左的前2組，4位一組，不足4位的補0
                for(int j=0;j<4-url.length();j++){
                    url = "0"+url;
                }
            }
            mid = url+mid;                       
                      count++;
               }
        return mid;
    }
}