How does this simple function that involves the regularization be implemented?
Judge a string (the string can contain only the following three characters)
1.26 Letters of English
2. "0,1,2,3,4,5,6,7,8,9" 10 digits
3. "-" (conjunction number in English)
------Solution--------------------
$str = "/[^0-9a-za-z]/i";
------Solution--------------------
The Khan Lou lied about the "-" drop.
$str = "/[^0-9a-za-z_]/i";
------Solution--------------------
The upstairs is wrong.
If the judgment does not exist, then '-' does this not count?
I decorate, what need a-za-z?
/^[a-z0-9-]+$/i
------Solution--------------------
PHP Code
preg_match ('/[-a-z0-9]+/i ', $str);//$STR is the string you want to match
------ Solution--------------------
PHP code
------Solution--------------------
discusses
PHP code
Preg_match ('/[-a- Z0-9]+/i ', $str); $str is the string you want to match
------Solution--------------------
Discussion
br>
Reference:
PHP code
!--? php
$str = "jsd-fowfmf564c-s1f23";
$pattern = '/^[a-z0-9-]+$/i ';//used Upstairs upstairs
Preg_match ($pattern, $str, $result);
if ($result)
{
echo "matches";
};
How is
?>
implemented with JS?