手机号码靓号匹配

手机号码靓号匹配

在做一个项目时需要对储存的所有号码进行靓号推荐,需要根据前台用户选择的号码模式将符合条件的号码返回前台进行显示,供用户进行选择。
原来打算通过数据库用sql的方式直接进行查找,即通过REGEXP关键字来通过正则表达式进行匹配,查阅相关文档,发现MySQL数据库的正则表达式支持度弱,只有部分简单的正则表达式可以支持,比如匹配以特定字符开始、结尾或包含某特定字符的情况。稍复杂一些的正则表达式就无法匹配到需要的结果。只能是通过将所有号码查询出来,再通过java编程方式使用正则表达式来处理结果集,返回符合特定模式的靓号。我自己只能想到这种处理方式,如果哪位大神有更好的处理方式也请告知。
自己用的两个正则表达式是:
匹配号码后4位为ABAB:

“^\d*(\d)(\d)\1\2$”

匹配号码后4位为AABB:
“^\d*(\d)\1(\d)\2$”
注意在使用时需要将”\”前添加一个”\”字符作为转义字符。
另外推荐两个其他人写的博客,上面有更多的关于匹配电话号码的正则表达式,可以参考他们的内容。
相关地址为:
博主名称为:”背着JAVA的蜗牛”的关于正则表达式匹配靓号的文章
正则表达式匹配手机号码靓号的另外一篇博客,可以点击前往查看参考

北京大学oj题目,已提交AC。原题目如下: Description Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Sometimes only part of the number is used to spell a word. When you get back to your hotel tonight you can order a pizza from Gino's by dialing 310-GINO. Another way to make a telephone number memorable is to group the digits in a memorable way. You could order your pizza from Pizza Hut by calling their ``three tens'' number 3-10-10-10. The standard form of a telephone number is seven decimal digits with a hyphen between the third and fourth digits (e.g. 888-1200). The keypad of a phone supplies the mapping of letters to numbers, as follows: A, B, and C map to 2 D, E, and F map to 3 G, H, and I map to 4 J, K, and L map to 5 M, N, and O map to 6 P, R, and S map to 7 T, U, and V map to 8 W, X, and Y map to 9 There is no mapping for Q or Z. Hyphens are not dialed, and can be added and removed as necessary. The standard form of TUT-GLOP is 888-4567, the standard form of 310-GINO is 310-4466, and the standard form of 3-10-10-10 is 310-1010. Two telephone numbers are equivalent if they have the same standard form. (They dial the same number.) Your company is compiling a directory of telephone numbers from local businesses. As part of the quality control process you want to check that no two (or more) businesses in the directory have the same telephone number. Input The input will consist of one case. The first line of the input specifies the number of telephone numbers in the directory (up to 100,000) as a positive integer alone on the line. The remaining lines list the telephone numbers in the directory, with each number alone on a line. Each telephone number consists of a string composed of decimal digits, uppercase letters (excluding Q and Z) and hyphens. Exactly seven of the characters in the string will be digits or letters. Output Generate a line of output for each telephone number that appears more than once in any form. The line should give the telephone number in standard form, followed by a space, followed by the number of times the telephone number appears in the directory. Arrange the output lines by telephone number in ascending lexicographical order. If there are no duplicates in the input print the line: No duplicates. Sample Input 12 4873279 ITS-EASY 888-4567 3-10-10-10 888-GLOP TUT-GLOP 967-11-11 310-GINO F101010 888-1200 -4-8-7-3-2-7-9- 487-3279 Sample Output 310-1010 2 487-3279 4 888-4567 3
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值