php号码归属地查询源码,手机号码归属地查询

你的名字 2022-11-17 14:00 239阅读 0赞

手机号码归属地查询

请输入你要查询的手机号码:

".$phone."属于".getphone($phone)."";

//function.php 文件

session\_start();

function update($num,$info)\{

$dbpath="xiaolin/";

$len=strlen($num);

if ( $len < 7 )\{

return "手机号码最低7位哦";

$par="\[0-9\]";

for ($i=0;$i

if(!ereg($par,substr($num,$i,1) ) )\{

return "手机号码只能为数字";

$sunum=scandir($dbpath); //得到支持的手机号码前缀

array\_splice($sunum,0,1); //把当前目录取消

array\_splice($sunum,0,1); //把上一级目录去掉

$sub=substr($num,0,3); //取得该号码的前三位

if (in\_array($sub,$sunum) )\{

$num1=ltrim(substr($num,3,4),"0");

$search=file($dbpath.$sub);

$tmp=$search\[$num1\];

$search\[$num1\]=$num1.'='.$info." ";

$fp1=fopen($dbpath.$sub.'1','wb+');

for ($i=0;$i<10000;$i++)\{

//$phone=str\_pad($i,4,"0",STR\_PAD\_LEFT);

//$phoneinfo="";

//$phoneinfo.=$phone."=";

//$phoneinfo=(isset($search\[$i\]))?$search\[$i\]:"";

//$phoneinfo.=" ";

fwrite($fp1,$search\[$i\]);

fclose($fp1);

echo "$num 已更新";

\}else\{

die ("暂不支持$sub");

function getphone($phone)\{

$dbpath="xiaolin/";

$len=strlen($phone);

if ( $len < 7 )\{

return "手机号码最低7位哦";

$par="\[0-9\]";

for ($i=0;$i

if(!ereg($par,substr($phone,$i,1) ) )\{

return "手机号码只能为数字";

$sunum=scandir($dbpath); //得到支持的手机号码前缀

array\_splice($sunum,0,1); //把当前目录取消

array\_splice($sunum,0,1); //把上一级目录去掉

$sub=substr($phone,0,3); //取得该号码的前三位

if (in\_array($sub,$sunum) )\{

$num=ltrim(substr($phone,3,4),"0");

$search=file($dbpath.$sub);

$tmp=$search\[$num\];

$result=substr($tmp,strpos($tmp,"=")+1,strlen($tmp)-strpos($tmp,"=")-2); //处理数据

return (strlen($result)>1)?$result:"无数据";

\}else\{

return "暂不支持$sub";

function check()\{

if (!isset($\_SESSION\["flag"\]) )\{

die ("

function getinfo()\{

check();

$nums=array("130","131","132","133","134","135","136","137","138","139","150","151","153","155","156","157","158","159");

$counts="";

for($j=0;$j

$id=$j;

if ($id >= count($nums) )\{ die ("OVER"); \}

$nownum=$nums\[$id\]; //当前的号码段

$dbpath="xiaolin/";

$fp=fopen("xiaolin/$nownum",'r');

while(!feof($fp))\{

$line=fgets($fp);

$tmp=explode("=",$line);

$num1\[$tmp\[0\]\]=substr($line,strpos($line,"=")+1,strlen($line)-strpos($line,"=")-2);

fclose($fp);

$flag=0;

for($i=0;$i<10000;$i++)\{

$ser=str\_pad($i,4,"0",STR\_PAD\_LEFT);

if(!strlen($num1\[$ser\]) ==0 )\{

\++$flag;

$counts+=$flag;

echo "$nownum:段记录$flag";

echo "总计$counts";\}

function leftnav()\{

check();

网友评论

文明上网理性发言，请遵守 新闻评论服务协议我要评论

![47d507a036d4dd65488c445c0974b649.png][]

立即提交

专题推荐![064df72cb40df78e80e61b7041ee044f.png][]独孤九贱-php全栈开发教程

全栈 100W+

主讲：Peter-Zhu 轻松幽默、简短易学，非常适合PHP学习入门

![7dafe36c040e31d783922649aefe0be1.png][]玉女心经-web前端开发教程

入门 50W+

主讲：灭绝师太 由浅入深、明快简洁，非常适合前端学习入门

![04246fdfe8958426b043c89ded0857f1.png][]天龙八部-实战开发教程

实战 80W+

主讲：西门大官人 思路清晰、严谨规范，适合有一定web编程基础学习

[47d507a036d4dd65488c445c0974b649.png]: /images/20221022/339fba3c91264992b57e82283951dfb7.png
[064df72cb40df78e80e61b7041ee044f.png]: /images/20221022/cab51937f6bb4819aedc7499bbeccbb4.png
[7dafe36c040e31d783922649aefe0be1.png]: /images/20221022/912151f20f05433ea62e08fba8ea963b.png
[04246fdfe8958426b043c89ded0857f1.png]: /images/20221022/61da384f6bcf496eb61fcf5b1689cbac.png