Skip to main content

正则表达式中的非字符^

 匹配未指定的单个字符

到目前为止,您已经创建了一组要匹配的字符,但您也可以创建一组不想匹配的字符。 这些类型的字符集称为否定字符集。


要创建否定字符集,请在左括号之后和不想匹配的字符之前放置一个脱字符 (^)。


例如,/[^aeiou]/gi 匹配所有不是元音的字符。 请注意,像 .、!、[、@、/ 和空格这样的字符是匹配的 - 否定元音字符集仅排除元音字符。


创建一个匹配所有非数字或元音字符的正则表达式。 请记住在正则表达式中包含适当的标志。

题目:

创建一个匹配所有非数字或元音字符的正则表达式。 请记住在正则表达式中包含适当的标志。

代码如下:

let quoteSample = "3 blind mice.";
let myRegex = /[^aeiou0-9]/gi// Change this line
let result =quoteSample.match(myRegex); // Change this line
console.log(result);

Comments

Popular posts from this blog

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 ())      ...