Update StringRecursion.java

All code is recursive here; absolutely no loops are used.  

longestWord finds and returns the word with the most letters in it from a given sentence. This program asssumes that the input does not contain digits or punctuation, and that words are separated by single spaces.  

compressedText decompress the input text, which has been compressed using the following algorithm:
Replace repetitive sequences of identical data items with short "tokens" that represent entire sequences. Applying this to a string involves finding sequences in the string where the same character repeats. Each such sequence should be replaced by a "token" consisting of the number of characters in the sequence, and the repeating character.
If a character does not repeat, it should be left alone.
Example: qwwwwwwwwweeeeerrtyyyyyqqqqwEErTTT becomes q9w5e2rt5y4qw2Er3T