zoukankan      html  css  js  c++  java
  • 密码安全等级效果

    <html>
    <head>
    <meta http-equiv="content-type" content="text/html; charset=utf-8">
    <title>JS判断密码强度</title>
    <script>
    //判断输入密码的类型
    function CharMode(iN){
    if (iN>=48 && iN <=57) //数字
    return 1;
    if (iN>=65 && iN <=90) //大写
    return 2;
    if (iN>=97 && iN <=122) //小写
    return 4;
    else
    return 8;
    }
    //bitTotal函数
    //计算密码模式
    function bitTotal(num){
    modes=0;
    for (i=0;i<4;i++){
    if (num & 1) modes++;
    num>>>=1;
    }
    return modes;
    }
    //返回强度级别
    function checkStrong(sPW){
    if (sPW.length<=4)
    return 0; //密码太短
    Modes=0;
    for (i=0;i<sPW.length;i++){
    //密码模式
    Modes|=CharMode(sPW.charCodeAt(i));
    }
    return bitTotal(Modes);
    }

    //显示颜色
    function pwStrength(pwd){
    O_color="#eeeeee";
    L_color="#FF0000";
    M_color="#FF9900";
    H_color="#33CC00";
    if (pwd==null||pwd==''){
    Lcolor=Mcolor=Hcolor=O_color;
    }
    else{
    S_level=checkStrong(pwd);

    switch(S_level) {
    case 0:
    Lcolor=Mcolor=Hcolor=O_color;
    case 1:
    Lcolor=L_color;
    Mcolor=Hcolor=O_color;
    break;
    case 2:
    Lcolor=Mcolor=M_color;
    Hcolor=O_color;
    break;
    default:
    Lcolor=Mcolor=Hcolor=H_color;
    }
    }
    document.getElementById("strength_L").style.background=Lcolor;
    document.getElementById("strength_M").style.background=Mcolor;
    document.getElementById("strength_H").style.background=Hcolor;
    return;
    }
    </script>
    </head>
    <body>
    <form name=form1 action="" >
    密码:<input type="password" size="8" onKeyUp="pwStrength(this.value)" onBlur="pwStrength(this.value)"><br>
    密码强度:
    <table width="210" border="1" cellspacing="0" cellpadding="1" bordercolor="#eeeeee" height="22" style='display:inline'>
    <tr align="center" bgcolor="#f5f5f5">
    <td width="33%" id="strength_L">弱</td>
    <td width="33%" id="strength_M">中</td>
    <td width="33%" id="strength_H">强</td>
    </tr>
    </table>
    </form>
    </body>
    </html>

  • 相关阅读:
    Python3 之 列表推导式
    python3 之 趣味数学题(爱因斯坦)
    python3 之 判断闰年小实例
    python3 之 判断字符串是否只为数字(isdigit()方法、isnumeric()方法)
    116.Populating Next Right Pointers in Each Node
    115.Distinct Subsequences
    114.Flatten Binary Tree to Linked List
    113.Path Sum II
    112.Path Sum
    111.Minimum Depth of Binary Tree
  • 原文地址:https://www.cnblogs.com/ll-taj/p/6601222.html
Copyright © 2011-2022 走看看