JavaScript check Password complexity Regular expression _ regular expression

The regular expressions currently used are as follows:

Copy Code code as follows:

(? =.*\d) (? =.*[a-za-z]) (? =.*[^a-za-z0-9]). {8,30}

The corresponding validation rule is that the password must contain letters, numbers, special characters, at least 8 characters, and a maximum of 30 characters.

This regular expression works fine in C #, but it is problematic in JavaScript.

How do you write such regular expressions in JS?

Test string: a123456-

The workaround looks like this:

Changing the \d to [0-9] solves the problem and the regular expression is as follows:

Copy Code code as follows:

var regex = new RegExp (' =.*[0-9]) (? =.*[a-za-z]) (? =.*[^a-za-z0-9]). { 8,30} ');
Console.log (regex.test (' a123456-'));

Here's how the regular expression verifies the password

Password rule: 6-20-digit alpha-numeric combination:

Copy Code code as follows:

var reg =/^[a-za-z0-9]{6,20}$/;

The above is a small set to introduce the JavaScript password complexity of the regular expression, I hope to help you, if you have any questions please give me a message, small series will promptly reply to everyone. Here also thank you very much for the cloud Habitat Community website support!