import java.util.*; import java.lang.StringBuffer; public class Solution { /** * * @param strs string字符串一维数组 * @return string字符串 */ public String longestCommonPrefix (String[] strs) { // write code here if(strs.length == 0){ return ""; } int curIndex = 0; String first = strs[0]; StringBuffer sb = new StringBuffer(); while(true){ if(first.length() <= curIndex){ return sb.toString(); } char next = first.charAt(curIndex); for(int i = 0;i< strs.length;i++){ String curS = strs[i]; //当前的index超过任何一个字符串的界限 则跳出循环 if(curS.length() <= curIndex){ return sb.toString(); } else { if(curS.charAt(curIndex) != next){ return sb.toString(); } } } sb.append(String.valueOf(next)); curIndex ++; } } }