标签:[] group highlight hang match lse class 匹配 lin
import re # line = ‘ahhuuhhaaahhhhang123‘ #line = ‘ahuuuhuuu‘ # 需要获取h和h之间,需要包含特定数量字符的子串 # 使用 + h和h之间至少要有一个字符 # {} 限定它前面出现的那个东西的出现次数 # match_res = re.search(‘h.{3,6}h‘, line) # if match_res: # print(match_res) # print(match_res.group(0)) # # print(match_res.group(1)) # # print(match_res.group(2)) # print(‘ojbk‘) # else: # print(‘no ojbk‘) # # match_res = re.search(‘h.+?h‘, line) # if match_res: # print(match_res) # print(match_res.group(0)) # # print(match_res.group(1)) # # print(match_res.group(2)) # print(‘ojbk‘) # else: # print(‘no ojbk‘) # # line = ‘sss127aaaanbsss127‘ # # # 匹配sss127 或者 aaa # # 或者 # match_res = re.search(‘(sss127|aaa)‘, line) # if match_res: # print(match_res) # print(match_res.group(0)) # # print(match_res.group(1)) # # print(match_res.group(2)) # print(‘ojbk‘) # else: # print(‘no ojbk‘) # [] 匹配中括号内部的任意一个字符 line = ‘sss127aaaanbsss127‘ match_res = re.search(‘([27s1]+)‘, line) if match_res: print(match_res) print(match_res.group(0)) # print(match_res.group(1)) # print(match_res.group(2)) print(‘ojbk‘) else: print(‘no ojbk‘)
标签:[] group highlight hang match lse class 匹配 lin
原文地址:https://www.cnblogs.com/gxsmm/p/9490910.html