Leetcode-14. Longest Common Prefix

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————
Write a function to find the longest common prefix string amongst an array of strings.
写这个算法让我明白了，先把很多特殊情况给返回了。Your
runtime beats 12.46% of java submissions.

public class Solution {
public String longestCommonPrefix(String[] strs) {
int position = 0;
if(strs.length == 0 ) return "";
if(strs.length == 1) return strs[0];
for(int i = 0 ; i < strs.length; i ++){
if(strs[i].length() == 0) return "";
}

while(true){
boolean over = false;
if(position == strs[0].length())break;
for(int i = 1 ; i < strs.length; i ++){
if(position == strs[i].length()){over = true;break;}
if(strs[i].charAt(position) != strs[i-1].charAt(position)){over = true; break;}
}
if(over) break;
position ++;

}
return strs[0].substring(0,position);
}
}