Open jmpark0118 opened 3 years ago
import re
s = input()
k = input()
l = re.compile(k)
m = l.search(s)
if not m:
print((-1, -1))
else:
r = 0
while m.end()+len(k)<len(s):
m = l.search(s, r)
print((m.start(), m.end()-1))
r = m.start()+1
import re
S = input()
k = input()
pattern = re.compile(k)
r = pattern.search(S)
if not r:
print((-1, -1))
while r:
print("({0}, {1})".format(r.start(), r.end() - 1))
r = pattern.search(S,r.start() + 1)
import re
s = input()
k = input()
l = re.compile(k)
m = l.search(s)
if not m:
print((-1, -1))
while m:
print((m.start(), m.end()-1))
m = l.search(s, m.start()+1)
출처 : https://www.hackerrank.com/challenges/re-start-re-end/problem