Created
June 5, 2014 21:50
-
-
Save gabhi/157a25554881b8efb2e1 to your computer and use it in GitHub Desktop.
Run Length Encoding - compress string by duplicate count
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.regex.Matcher; | |
import java.util.regex.Pattern; | |
public class RunLengthEncoding { | |
public static String encode(String source) { | |
StringBuffer dest = new StringBuffer(); | |
for (int i = 0; i < source.length(); i++) { | |
int runLength = 1; | |
while (i+1 < source.length() && source.charAt(i) == source.charAt(i+1)) { | |
runLength++; | |
i++; | |
} | |
dest.append(runLength); | |
dest.append(source.charAt(i)); | |
} | |
return dest.toString(); | |
} | |
public static String decode(String source) { | |
StringBuffer dest = new StringBuffer(); | |
Pattern pattern = Pattern.compile("[0-9]+|[a-zA-Z]"); | |
Matcher matcher = pattern.matcher(source); | |
while (matcher.find()) { | |
int number = Integer.parseInt(matcher.group()); | |
matcher.find(); | |
while (number-- != 0) { | |
dest.append(matcher.group()); | |
} | |
} | |
return dest.toString(); | |
} | |
public static void main(String[] args) { | |
String example = "WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW"; | |
System.out.println(encode(example)); | |
System.out.println(decode("1W1B1W1B1W1B1W1B1W1B1W1B1W1B")); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment