编程手机号

① java编程实现自定义异常判断一个手机号码的合法性

用正则判断，

/**
*验证手机号码格式是否正确
*@parammobiles
*@returntrue表示正确false表示不正确
*/
(Stringmobiles){
Patternp=Pattern.compile("^((13[0-9])|(15[0-9])|(18[0-9]))\d{8}");
Matcherm=p.matcher(mobiles);
returnm.matches();
}

当然手机号码好像还有17开头的，对应的正则改一下就好

"^((13[0-9])|(15[0-9])|(18[0-9])|(17[0-9]))\d{8}"

然后在你的代码里面调用这个方法，如果结果为false，就throw new MyException(“手机号码格式不正确”)一个异常。

异常定义可以去继承Exception

/**
*CreatedbyKevinon2015/3/30.
*/
{

privateStringmsg;

publicMyException(Stringmsg){
super(msg);
this.msg=msg;
}


@Override
publicStringgetMessage(){
returnmsg;
}
}

② 用JAVA编程:输入一个字符串,要求该字符串是一个11位数的手机号码

这是一个正则式的问题
//校验手机号码：必须以数字开头，除数字外，可含有“-”
function isMobile(s)
{
//var patrn=/^[+]{0,1}(\d){1,3}[ ]?([-]?((\d)|[ ]){1,12})+$/;
var patrn=/^((\(\d{0,3}\))|(\d{0,3}\-))?13|15\d{9}$/;
if (!patrn.exec(s)){
return false;
}
return true;
}

③ 电话号码编程

#include
#include
#include
int cmp(const void *a, const void *b){
return(*(int *)a-*(int *)b);
}
int main(){
char str[100];
int num[26]={2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 0, 7, 7, 8, 8, 8, 9, 9, 9, 0};
int n, a[100005], l, sum, i, k, flag, t, s, j, p;
scanf("%d", &n);
getchar();
k = 0;
while (k!=n){
gets(str);
l = strlen(str);
sum = 0;
for (i=0; i
if (str[i]>= '0' && str[i] <= '9'){
sum = sum*10 + str[i]-'1'+1;
continue;
}
if (str[i]>='A' && str[i]<='Z'){
if (str[i] == 'Q' || str[i] == 'Z') continue;
sum = sum * 10 + num[str[i]-'A'];
}
}
a[k] = sum;
k++;
}
a[k] = -1;

t = a[0];
flag = 0;
i = 1;
s = 1;
while (i!=k+1){
if (t == a[i]){
s++;
flag = 1;
}else {
if (s>1){
p = 1000000;
for(j=1; j<=3; j++){
printf("%d", t/p);
t = t%p;
p = p/10;
}
printf("-");
t = t000;
p = 1000;
for (j=1; j<=4; j++){
printf("%d", t/p);
t = t%p;
p = p/10;
}
printf(" %d\n", s);
}
t = a[i];
s=1;
}
i++;
}
if (flag == 0){
printf("No plicates.\n");
}
return 0;
}