blocks|key|3263908|text|适应该正则表达式的最好方法是丢弃它，转而编写一些代码。所需的正则表达式将是如此冗长和复杂，以至于您在编写它两个小时后无法阅读它。等效的PHP代码会很单调乏味，但至少您能够理解您所编写的内容。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3263909|顺便说一句，这不是对你的猛烈抨击。正则表达式在大多数情况下只是勉强适用于密码强度验证，但是您的需求比通常情况下更复杂，这是不值得的。另外，你发布的正则表达式也是垃圾。永远不要相信你在web上发现的那些正则表达式。或者任何代码，就这点而言。或者，见鬼，什么都行。:-/|3263910|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|G|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|H|8|@]|9|@]|A|$]]]|E|$]]

The best way to adapt that regex is to chuck it out and write some code instead. The required regex would be so long and complicated, you wouldn't be able to read it two hours after you wrote it. The equivalent PHP code will be tedious, but at least you'll be able understand what you wrote.

This isn't meant as a slam on you, by the way. Regexes are just barely suitable for password-strength validation in most cases, but your requirements are more complicated than usual, and it's just not worth it. Also, that regex you posted is crap. Never trust regexes you find floating around the web. Or any code, for that matter. Or, heck, anything. :-/

blocks|key|3050241|text|如果你真的想使用正则表达式，试试这个：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3050242|(?=%5E(?:[%5EA-Z]*[A-Z]){2})(?=%5E(?:[%5Ea-z]*[a-z]){2})(?=%5E(?:\D*\d){2})(?=%5E(?:\w*\W){2})%5E[A-Za-z\d\W]{8,}$|code-block|syntax|javascript|3050243|一些解释：|3050244|3050245|(?=%5E(?:[%5EA-Z]*[A-Z]){2})测试两次重复的letter|unordered-list-item|offset|length|style|CODE|3050246|(?=%5E(?:[%5Ea-z]*[a-z]){2})，[%5EA-Z]*[A-Z]是除大写字母后跟一个大写letter|3050247|(?=%5E(?:[%5Ea-z]*[a-z]){2})之外的一个由零个或多个字符组成的序列(与上面的小写letters)|3050248|(?=%5E(?:\D*\d){2})相同(对于非单词字符，与上面的相同，但您可以使用任何特殊字符来更改\W，只要您want)|3050249|%5E[A-Za-z\d\W]{8,}$测试的整个字符串的长度仅由所有其他字符类的联合字符组成)。|3050250|3050251|entityMap^0|0|0|0|0|0|O|0|0|O|P|C|0|0|O|0|0|H|1E|2|0|0|I|0|0^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|12|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|13|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|14|8|@]|9|@]|A|$]]|$1|J|3|K|5|L|7|15|8|@$M|16|N|17|O|P]]|9|@]|A|$]]|$1|Q|3|R|5|L|7|18|8|@$M|19|N|1A|O|P]|$M|1B|N|1C|O|P]]|9|@]|A|$]]|$1|S|3|T|5|L|7|1D|8|@$M|1E|N|1F|O|P]]|9|@]|A|$]]|$1|U|3|V|5|L|7|1G|8|@$M|1H|N|1I|O|P]|$M|1J|N|1K|O|P]]|9|@]|A|$]]|$1|W|3|X|5|L|7|1L|8|@$M|1M|N|1N|O|P]]|9|@]|A|$]]|$1|Y|3|-4|5|6|7|1O|8|@]|9|@]|A|$]]|$1|Z|3|-4|5|6|7|1P|8|@]|9|@]|A|$]]]|10|$]]

If you really want to use a regular expression, try this:

<pre><code>(?=^(?:[^A-Z]*[A-Z]){2})(?=^(?:[^a-z]*[a-z]){2})(?=^(?:\D*\d){2})(?=^(?:\w*\W){2})^[A-Za-z\d\W]{8,}$
</code></pre>

Some explanation:

<ul>
<li><code>(?=^(?:[^A-Z]*[A-Z]){2})</code> tests for two repetitions of <code>[^A-Z]*[A-Z]</code> which is a sequence of zero or more characters except uppercase letters followed by one uppercase letter</li>
<li><code>(?=^(?:[^a-z]*[a-z]){2})</code> (same as above with lowercase letters)</li>
<li><code>(?=^(?:\D*\d){2})</code> (same as above with digits)</li>
<li><code>(?=^(?:\w*\W){2})</code> (same as above with non-word characters, but you may change <code>\W</code> with a character class of whatever special characters you want)</li>
<li><code>^[A-Za-z\d\W]{8,}$</code> tests the length of the whole string consisting only of character of the union of all other character classes.</li>
</ul>

blocks|key|310760|text|我不得不同意艾伦的观点。如果现有的正则表达式如此复杂，为什么还要在一个正则表达式中完成它呢？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|310761|只要把它分解成容易接近的简单步骤即可。您已经这样做了。|310762|现在编写4正则表达式来验证您的部件，向4正则表达式添加基本逻辑并测量字符串的长度。好了。|310763|你更愿意调试哪一个，这个：|310764|(?=%5E(?:[%5EA-Z]*[A-Z]){2})(?=%5E(?:[%5Ea-z]*[a-z]){2})(?=%5E(?:\D*\d){2})(?=%5E(?:\w*\W){2})%5E[A-Za-z\d\W]{8,}$+(顺便说一下，它不能工作...)|offset|length|style|CODE|310765|或者这样：|310766|function+valid_pass($candidate)+{
+++$r1='/[A-Z]/';++//Uppercase
+++$r2='/[a-z]/';++//lowercase
+++$r3='/[!@#$%25%5E&*()\-_=%2B{};:,<.>]/';++//+whatever+you+mean+by+'special+char'
+++$r4='/[0-9]/';++//numbers

+++if(preg_match_all($r1,$candidate,+$o)<2)+return+FALSE;

+++if(preg_match_all($r2,$candidate,+$o)<2)+return+FALSE;

+++if(preg_match_all($r3,$candidate,+$o)<2)+return+FALSE;

+++if(preg_match_all($r4,$candidate,+$o)<2)+return+FALSE;

+++if(strlen($candidate)<8)+return+FALSE;

+++return+TRUE;
}|code-block|syntax|javascript|310767|为什么人们觉得他们必须编写一个没有人能理解的正则表达式，这样他们就可以一口气完成它，这超出了我的理解……|310768|310769|好的，好的--如果您真的想要一个正则表达式，那么学习lookaheads来验证您的规则。|310770|这个怪物一下子就完成了你要求的事情：|310771|%5E++++++++++++++++++++++++++++++++++++++++#+start+of+line
(?=(?:.*[A-Z]){2,})++++++++++++++++++++++#+2+upper+case+letters
(?=(?:.*[a-z]){2,})++++++++++++++++++++++#+2+lower+case+letters
(?=(?:.*\d){2,})+++++++++++++++++++++++++#+2+digits
(?=(?:.*[!@#$%25%5E&*()\-_=%2B{};:,<.>]){2,})++#+2+special+characters
(.{8,})++++++++++++++++++++++++++++++++++#+length+8+or+more
$++++++++++++++++++++++++++++++++++++++++#+EOL+|310772|Demo|310773|entityMap|0|LINK|mutability|MUTABLE|url|http://www.rexegg.com/regex-lookarounds.html|1|https://regex101.com/r/pX7jN4/3^0|0|0|0|0|0|2S|0|0|0|0|0|Q|A|0|0|0|0|0|4|1|0^^$0|@$1|2|3|4|5|6|7|1F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|1G|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|1H|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|1I|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|1J|8|@$J|1K|K|1L|L|M]]|9|@]|A|$]]|$1|N|3|O|5|6|7|1M|8|@]|9|@]|A|$]]|$1|P|3|Q|5|R|7|1N|8|@]|9|@]|A|$S|T]]|$1|U|3|V|5|6|7|1O|8|@]|9|@]|A|$]]|$1|W|3|-4|5|6|7|1P|8|@]|9|@]|A|$]]|$1|X|3|Y|5|6|7|1Q|8|@]|9|@$J|1R|K|1S|1|1T]]|A|$]]|$1|Z|3|10|5|6|7|1U|8|@]|9|@]|A|$]]|$1|11|3|12|5|R|7|1V|8|@]|9|@]|A|$S|T]]|$1|13|3|14|5|6|7|1W|8|@]|9|@$J|1X|K|1Y|1|1Z]]|A|$]]|$1|15|3|-4|5|6|7|20|8|@]|9|@]|A|$]]]|16|$17|$5|18|19|1A|A|$1B|1C]]|1D|$5|18|19|1A|A|$1B|1E]]]]

I have to agree with Alan. If the existing regex is so complicated, why try and do it in just one regex? 

Just break it down into approachable simple steps. You have already done that. 

Now write 4 regex to validate your parts, add basic logic to the 4 regex and measure the length of the string. Done.

Which would you rather debug, this:

<code>(?=^(?:[^A-Z]*[A-Z]){2})(?=^(?:[^a-z]*[a-z]){2})(?=^(?:\D*\d){2})(?=^(?:\w*\W){2})^[A-Za-z\d\W]{8,}$</code> (which does not work btw...)

or this:

<pre><code>function valid_pass($candidate) {
 $r1='/[A-Z]/'; //Uppercase
 $r2='/[a-z]/'; //lowercase
 $r3='/[!@#$%^&amp;*()\-_=+{};:,&lt;.&gt;]/'; // whatever you mean by 'special char'
 $r4='/[0-9]/'; //numbers

 if(preg_match_all($r1,$candidate, $o)&lt;2) return FALSE;

 if(preg_match_all($r2,$candidate, $o)&lt;2) return FALSE;

 if(preg_match_all($r3,$candidate, $o)&lt;2) return FALSE;

 if(preg_match_all($r4,$candidate, $o)&lt;2) return FALSE;

 if(strlen($candidate)&lt;8) return FALSE;

 return TRUE;
}
</code></pre>

Why folks feel they have to write a regex that no one can understand just so they can do it in one go is beyond me...

<hr>

Ok ok -- if you really want a single regex, learn about <a href="http://www.rexegg.com/regex-lookarounds.html" rel="noreferrer">lookaheads</a> to validate your rules.

This monster does what you asked in one go:

<pre><code>^ # start of line
(?=(?:.*[A-Z]){2,}) # 2 upper case letters
(?=(?:.*[a-z]){2,}) # 2 lower case letters
(?=(?:.*\d){2,}) # 2 digits
(?=(?:.*[!@#$%^&amp;*()\-_=+{};:,&lt;.&gt;]){2,}) # 2 special characters
(.{8,}) # length 8 or more
$ # EOL 
</code></pre>

<a href="https://regex101.com/r/pX7jN4/3" rel="noreferrer">Demo</a>

I've seen the following regular expression around the web.

<pre><code>(?=^.{8,}$)((?=.*\d)|(?=.*\W+))(?![.\n])(?=.*[A-Z])(?=.*[a-z]).*$
</code></pre>

It validates only if the string:

<pre><code> * contain at least (1) upper case letter
 * contain at least (1) lower case letter
 * contain at least (1) number or special character
 * contain at least (8) characters in length
</code></pre>

I'd like to know how to convert this regular expression so that it checks the string to

<pre><code>* contain at least (2) upper case letter
* contain at least (2) lower case letter
* contain at least (2) digits
* contain at least (2) special character
* contain at least (8) characters in length
</code></pre>

Well, if it contains at least 2 upper,lower,digits and special characters then I wouldn't
need the 8 characters length.

Special characters include: 

<blockquote>
 `~!@#$%^&amp;*()_-+=[]\|{};:'".,/&lt;>?
</blockquote>

PHP regular expression for strong password validation

我在网上看到了下面的正则表达式。(?=^.{8,}$)((?=.*\d)|(?=.*\W+))(?![.\n])(?=.*[A-Z])(?=.*[a-z]).*$它仅在以下情况下验证：   * contain at least (1) upper case letter   * contain at least (1)...

问用于强密码验证的PHP正则表达式
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问用于强密码验证的PHP正则表达式EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问用于强密码验证的PHP正则表达式
EN