public class Solution {
    /**
     * @param strs: A list of strings
     * @return: The longest common prefix
     */
    public String longestCommonPrefix(String[] strs) {
        if (strs == null || strs.length == 0) {
            return "";
        }
        // use first one as prefix, compare to other string in the list, until end.
        String prefix = strs[0];
        for (int i = 1; i < strs.length; i++) {
            int j = 0;
            while (j < strs[i].length() && j < prefix.length() && prefix.charAt(j) == strs[i].charAt(j)) {
                j++;
            }
            if (j == 0) {
                return "";
            }
            prefix = prefix.substring(0,j);
        }
        return prefix;
    }
}

@@ -10,16 +10,27 @@
 ass 
-Solution
+LongestCommonPrefix
  %7B%0A 

Update LongestCommonPrefix.java