J
Joe
I can't get my mind around constructing a function to find the longest
string of black/default words in a document. About half of the words
in the doc are red or blue or green.
Not sure how to handle words that are half black and half red.
The characters are in Unicode Greek, not roman characters.
Ideas?
string of black/default words in a document. About half of the words
in the doc are red or blue or green.
Not sure how to handle words that are half black and half red.
The characters are in Unicode Greek, not roman characters.
Ideas?