加入收藏 | 设为首页 | 会员中心 | 我要投稿 李大同 (https://www.lidatong.com.cn/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 百科 > 正文

正则表达式将字词与唯一(不重复)字符进行匹配

发布时间:2020-12-14 06:32:52 所属栏目:百科 来源:网络整理
导读:我正在寻找一个正则表达式,只有当它的所有字符都是唯一的,这意味着该单词中的每个字符才会出现一次。 例: abcdefg – 将返回MATCH abcdefgbh – 将返回NO MATCH(因为字母b重复多次) 尝试这个,可能会工作, ^(?:([A-Za-z])(?!.*1))*$ 说明 Assert positi
我正在寻找一个正则表达式,只有当它的所有字符都是唯一的,这意味着该单词中的每个字符才会出现一次。

例:
abcdefg – >将返回MATCH
abcdefgbh – >将返回NO MATCH(因为字母b重复多次)

尝试这个,可能会工作,
^(?:([A-Za-z])(?!.*1))*$

说明

Assert position at the beginning of a line (at beginning of the string or after a line break character) ?^?
Match the regular expression below ?(?:([A-Z])(?!.*1))*?
   Between zero and unlimited times,as many times as possible,giving back as needed (greedy) ?*?
   Match the regular expression below and capture its match into backreference number 1 ?([A-Z])?
      Match a single character in the range between “A” and “Z” ?[A-Z]?
   Assert that it is impossible to match the regex below starting at this position (negative lookahead) ?(?!.*1)?
      Match any single character that is not a line break character ?.*?
         Between zero and unlimited times,giving back as needed (greedy) ?*?
      Match the same text as most recently matched by capturing group number 1 ?1?
Assert position at the end of a line (at the end of the string or before a line break character) ?$?

(编辑:李大同)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读