php实现信用卡校验位算法THE LUHN MOD-10示例_php实例

WBOY
Release: 2016-06-07 17:20:11
Original
846 people have browsed it

按照ISO 2894中支付卡校验位的算法 The Luhn Mod-10 Method 规定:

1、对卡号上的每位数字乘以权重。其规则是,如果卡号数字个数是偶数,则第一位乘以2,否则就乘以1,然后以后分别是,1,2,1,2,1,2;
2、如果每位数字乘以权重后超过9 ,则需要减去 9;
3、将所有的处理过的加权数字求和,用 数字 10 求模运算;
4、余数应该是0,否则可能是输入错误。也可能是一个假号。
 顺手PHP简单实现下,实际场景前端验证好一些,例如JS。

 

复制代码 代码如下:

 function check_card($card){ 
    if (!is_numeric($card)) return False; 
    $card_len = strlen($card); 
    $i = 0; 
    $num_i = array(); 
    do{ 
        if (!$i){ 
            $num_x = $card_len % 2 ? 1 : 2; 
        } else { 
            $num_x = $num_x == 1 ? 2 : 1;     
        } 
        $num_i[$i] = (int)$card[$i] * $num_x; 
        $num_i[$i] = $num_i[$i] > 9 ? $num_i[$i] - 9 : $num_i[$i]; 

    }while(isset($card[++$i])); 
    $num_sum = array_sum($num_i); 
    return $num_sum % 10 ? False : True; 

 
Related labels:
php
source:php.cn
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Popular Tutorials
More>
Latest Downloads
More>
Web Effects
Website Source Code
Website Materials
Front End Template
About us Disclaimer Sitemap
php.cn:Public welfare online PHP training,Help PHP learners grow quickly!