again module re and it is longer and slower than it should be clear solution for Long Repeat by samatdav02 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

again module re and it is longer and slower than it should be solution in Clear category for Long Repeat by samatdav02

import re
def long_repeat(line):
    try:
        return len(max([m.group() for m in re.finditer(r'(.)\1*', line)],key=len)) #division into groups with the same letters
    except:
        return 0 #if input is ""

July 22, 2019

Comments:

FirstShanti on Sept. 9, 2019, 11:24 p.m.
Can you explain what that do?)

samatdav02 on Sept. 10, 2019, 6:01 p.m.
Using the "re" module, I divide the string into substrings with the same characters (aaabbbcc to aaa, bbb, cc) I use the max function with the length key to find among them the longest substring, and I find its length using the length function. Division occurs as follows: the .finditer finds all the necessary substrings according to the pattern r '(.) \ 1 *', and the .group and the loop "for" extract them and create a list. You just have to try to understand what this pattern gives)) "." this is any character, brackets mean a group of characters, "\ 1" means the first character of the group, "*" means repeating 0 or more times. That's all I can tell about this pattern, then I think you can understand it yourself I understand that my explanation is terrible, but I tried)) I am rarely asked about this

FirstShanti on Sept. 10, 2019, 9:12 p.m.
I not often use re, but made sure that is powerful instrument to manipulate data. You answer covered my questions, that was about re and namely this pattern r'(.)\1*’. Thanks!

Strings Theory

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!