Longest Common Prefix

Package cn.edu.xidian.sselab.string;

/**
*
* @author Zhiyong Wang
* Title:longest Common Prefix
* Content:
*
*write a function to find the longest common prefix string amongst an array of strings.
*/
public class Longestcommonprefix {

Judge the first string as a prefix, and then start the traversal from the second string, if his indexof is not equal to 0, stating that the first string is not his prefix.
At this point, the last digit of the first string is removed as a prefix to continue judging until the string is his prefix, and then determine whether he is the next prefix, the time complexity is O (N)
Public String Longestcommonprefix (string[] strs) {
if (STRs = = NULL | | strs.length = = 0) return "";
String pre = strs[0];
int i = 1;
while (I < strs.length) {
while (Strs[i].indexof (PRE)! = 0)
Pre = Pre.substring (0,pre.length ()-1);
i++;
}
return pre;
}

}

Longest Common Prefix