Timeline for String compression by using repeated characters count
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2015 at 12:47 | comment | added | Helix Quar | Let us continue this discussion in chat. | |
| Oct 29, 2015 at 12:38 | comment | added | Helix Quar | I grabbed the idea from stackoverflow.com/a/1660739/1230956. | |
| Oct 29, 2015 at 12:35 | comment | added | t3chb0t |
@helix or add it to you answer with an explanation. Especially the \1 is a bit mystery to me.
|
|
| Oct 29, 2015 at 12:32 | comment | added | t3chb0t | @helix this is a cool pattern ;-) Would you explain how it works? | |
| Oct 29, 2015 at 12:26 | comment | added | Helix Quar | With "(.)\1{0,}", you'll have to use the matches themselves instead of the match groups. Needs to be modified a little. Roughly like this: ideone.com/GsHIo0 | |
| Oct 29, 2015 at 12:22 | comment | added | t3chb0t |
@helix It doesn't work with this pattern. The result is: abcdezb or did you mean a different usage like not with Regex.Matches?
|
|
| Oct 29, 2015 at 12:14 | comment | added | Helix Quar | Matching "(.)\1{0,}" would be even shorter and would work for non-alphabetical characters. | |
| Oct 29, 2015 at 9:37 | history | edited | Heslacher | CC BY-SA 3.0 |
deleted 3 characters in body
|
| Oct 29, 2015 at 9:34 | history | edited | t3chb0t | CC BY-SA 3.0 |
deleted 619 characters in body
|
| Oct 29, 2015 at 9:26 | history | edited | t3chb0t | CC BY-SA 3.0 |
added 760 characters in body
|
| Oct 29, 2015 at 9:12 | history | edited | t3chb0t | CC BY-SA 3.0 |
added 1 character in body
|
| Oct 29, 2015 at 9:10 | history | answered | t3chb0t | CC BY-SA 3.0 |