14. Longest Common Prefix
- Total Accepted: 112204
- Total Submissions: 385070
- Difficulty: Easy
Write a function to find the longest common prefix string amongst an array of strings.
思路:
题目很简单,求字符串数组的最长的共同前缀。也没什么思路,诸位比较呗,代码如下:
1 public class No_014 { 2 public String longestCommonPrefix(String[] strs) { 3 if(strs == null || strs.length == 0){ 4 return "" ; 5 } 6 StringBuilder res = new StringBuilder() ; 7 //通过flag标志位来判断是否结束循环,以及是否应该加入返回的结果中 8 boolean flag = true ; 9 int index = 0 ; 10 while(flag){ 11 char ch ; 12 if(index < strs[0].length()){ 13 ch = strs[0].charAt(index) ; 14 }else{ 15 flag = false ; 16 continue ; 17 } 18 for(int i = 1 ; i < strs.length ; i++){ 19 if(index < strs[i].length() && strs[i].charAt(index) == ch){ 20 continue ; 21 }else{ 22 flag = false ; 23 break ; 24 } 25 } 26 //通过判断flag的值来判断是否是满足所有条件的 27 if(flag){ 28 res.append(ch) ; 29 index++ ; 30 } 31 } 32 return res.toString() ; 33 } 34 }