Longest Common Prefix (LeetCode)

 Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string "".

 

Example 1:

Input: strs = ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

SOLUTIONS (Java):

class Solution {
    public String longestCommonPrefix(String[] strs) {
        int n=strs.length,c=0;
        if(n==0||strs==null)
            return "";
        Arrays.sort(strs);
        String first=strs[0], Last=strs[n-1];
        while(c<first.length()){
            if(first.charAt(c)==Last.charAt(c))
                c++;
            else
                break;
        }
      return c==0?"":first.substring(0,c);  
    }
}