3ms Java Solution, sort the array and compare the first & last elements

  • 2
    public class Solution {
        public String longestCommonPrefix(String[] strs) {
            if(strs==null || strs.length==0) return "";
            char[] first = strs[0].toCharArray();
            char[] last = strs[strs.length-1].toCharArray();
            int len = Math.min(first.length, last.length);
            for(int i=0; i<len; i++){
                if(first[i]!=last[i]) return strs[0].substring(0,i);
            return strs[0];

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.