Regular matching numbers, English and English symbols

Hello everyone , I meet you again , I'm your friend, Quan Jun .

Search the Internet for many regular verification methods , But there is no ideal solution . I summed up , There are two ways to solve this problem .

1、 Each character is verified by a circular string , This method is simple without introduction

2、 adopt ASCII Match the number of matches to determine whether they match （ Don't cycle ）

The second way is to perform regular verification without loop to achieve the detection effect , This is also the reason why bloggers have not found a suitable method ( The total sensory cycle is unnecessary ).

new RegExp("[\x20-\x7E]{"+str.length+"}")

Copy

By numbers , English and English symbols ASCII Code range for string validation , And add the number of times it appears , If there is no match between the length of the string and the number of times, it is proved that there are characters outside the range . If you simply take ASCII Code range for verification , Only characters that appear in the range will be returned true, It doesn't directly tell us whether there are characters outside the range .

Publisher ： Full stack programmer stack length , Reprint please indicate the source ：https://javaforall.cn/150618.html Link to the original text ：https://javaforall.cn