Suppose we have the following method (it is in c code):

const char *bitap_search(const char *text, const char *pattern)

My question is how can I compare text and pattern if they are char? This method is like a substring problem but I am confused a bit can I write in term of char such code? if (text[i]==pattern[i])? look i am interesting at this algorithm in java http://en.wikipedia.org/wiki/Bitap_algorithm how implement this in java?

R = malloc((k+1) * sizeof *R);

and please help me to translate this code in java