[leetcode]Longest Common Prefix

 1 public class Solution {
 2     public String longestCommonPrefix(String[] strs) {
 3         if(strs == null || strs.length == 0) return "";
 4         StringBuilder sb = new StringBuilder();
 5         int shortestLength = Integer.MAX_VALUE; 
 6         for(String s : strs){
 7             shortestLength = Math.min(shortestLength,s.length());
 8         }
 9         breakable:
10         for(int i = 0; i < shortestLength; i++){
11             char c = strs[0].charAt(i);
12             for(String s : strs){
13                 if(s.charAt(i) != c){
14                     break breakable;
15                 }
16             }
17             sb.append(c);
18         }
19         return sb.toString();
20     }
21 }