在追求更短的數(shù)字排序時我們常會用到36進制

/**

* @desc? im:十進制數(shù)轉換成三十六進制數(shù)

* @param (int)$num 十進制數(shù)

* return 返回：三十六進制數(shù)

*/

private function get_char($num) {

$num = intval($num);

if ($num <= 0)

return false;

$charArr = array("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');

$char = '';

do {

$key = ($num% 36);//取余

$char= $charArr[$key-1].$char;//余數(shù)

$num =floor(($num - $key))/36;

} while ($num > 0);

return $char;

}

/**

* @desc? im:三十六進制數(shù)轉換成十進制數(shù)

* @param (string)$char 三十六進制數(shù)

* return 返回：十進制數(shù)

*/

private? function get_num($char){

$array=array("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");

$len=strlen($char);

for($i=0;$i<$len;$i++){

$index=array_search($char[$i],$array);

$sum+=($index+1)*pow(36,$len-$i-1);

}

return $sum;

}