1. 程式人生 > >正則 {} | 【】

正則 {} | 【】

earch match pri 獲取 mat sss hhhh 子串 至少

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‘)

  

正則 {} | 【】