zoukankan      html  css  js  c++  java
  • 前端使用jquery判断密码强度

    参考:https://www.jb51.net/article/74978.htm

    html代码:

    <input type="password" name="pass" id="pass" />
    <span id="passstrength"></span>

    js代码:

    $('#pass').keyup(function(e) {
     var strongRegex = new RegExp("^(?=.{8,})(?=.*[A-Z])(?=.*[a-z])(?=.*[0-9])(?=.*\W).*$", "g");
     var mediumRegex = new RegExp("^(?=.{7,})(((?=.*[A-Z])(?=.*[a-z]))|((?=.*[A-Z])(?=.*[0-9]))|((?=.*[a-z])(?=.*[0-9]))).*$", "g");
     var enoughRegex = new RegExp("(?=.{6,}).*", "g");
     if (false == enoughRegex.test($(this).val())) {
     $('#passstrength').html('More Characters');
     } else if (strongRegex.test($(this).val())) {
     $('#passstrength').className = 'ok';
     $('#passstrength').html('Strong!');
     } else if (mediumRegex.test($(this).val())) {
     $('#passstrength').className = 'alert';
     $('#passstrength').html('Medium!');
     } else {
     $('#passstrength').className = 'error';
     $('#passstrength').html('Weak!');
     }
     return true;
    });

    实现的效果是:在input框中输入任意字符,js代码会自动获取输入的内容,并判断其强度。

  • 相关阅读:
    SPOJ Distinct Substrings(后缀数组求不同子串个数,好题)
    POJ 1743 Musical Theme(后缀数组+二分答案)
    HDU 6191 Query on A Tree(可持久化Trie+DFS序)
    swust oj 1052
    swust oj 1051
    swust oj 1016
    swust oj 1014
    swust oj 1013
    swust oj 1012
    swust oj 1011
  • 原文地址:https://www.cnblogs.com/t-road/p/14448520.html
Copyright © 2011-2022 走看看