正则表达式对username进行检查-The idle Process

正则表达式对username进行检查

互联网上到处都在使用用户名。它们为用户在他们最喜欢的网站上提供了独特的身份。

您需要检查数据库中的所有用户名。以下是用户在创建用户名时必须遵循的一些简单规则。

1. 用户名只能使用字母数字字符。

2. 用户名中唯一的数字必须在末尾。最后可以有零个或多个。用户名不能以数字开头。

3. 用户名字母可以是小写和大写。

4. 用户名必须至少有两个字符长。两个字符的用户名只能使用字母作为字符。

let username = "JackOfAllTrades"; const userCheck = /^[a-z]([0-9]{2,}|[a-z]+\d*)$/i; let result = userCheck.test(username);

Comments

Low risk, high reward: the asymmetric black swan trade

Cornwall Capital was founded in 2003 by two young people who were not in the mainstream - Charlie Ledley, and Gammy Mak. I say they were out of the mainstream because they were not financial professionals from a scientific background, but they were full of imagination, and a keen insight into the market. Their insight is evident in the transactions of First Capital Financial. Case Background Before betting that the subprime mortgage market would collapse, Cornwall Capital first noticed a credit card business company, First Capital Financial. Throughout the 1990s and early 2000s, First Capital Financial claimed that it had better tools than other firms for analyzing the creditworthiness of subprime credit card users and pricing the risk of lending to them, and the market bought that claim. But in July 2002, First Capital Financial's stock fell 60% in two days after the company voluntarily disclosed a disagreement between them and two government regulators: How much capital did they ...

盘点类似河北的儿童杀人案，是如何判决的

javascript Mutations

Return true if the string in the first element of the array contains all of the letters of the string in the second element of the array. For example, ["hello", "Hello"], should return true because all of the letters in the second string are present in the first, ignoring case. The arguments ["hello", "hey"] should return false because the string hello does not contain a y. Lastly, ["Alien", "line"], should return true because all of the letters in line are present in Alien. function mutation ( arr ) { var temArr =[]; for ( let i = 0 ; i < arr [ 1 ]. length ; i ++) //要比较的是第二个数组的，所以放在外层，内层每次都要遍历第一个数组，让第二个数组中的字符去与每一个第一个数组中的字符比较，相等就push一个true，然后马上跳出内循环 { for ( let j = 0 ; j < arr [ 0 ]. length ; j ++) { if ( arr [ 1 ][ i ]. toUpperCase ()== arr [ 0 ][ j ]. toUpperCase ()) ...

The idle Process

Search This Blog