LeetCode 14. 最长公共前缀

最新推荐文章于 2024-08-10 22:52:22 发布

HorsePower_

最新推荐文章于 2024-08-10 22:52:22 发布

阅读量48

点赞数

分类专栏： LeetCode java 文章标签：最长公共前缀字符串比较动态规划排序算法 Comparator

本文链接：https://blog.csdn.net/HorsePower_/article/details/124531132

版权

LeetCode 同时被 2 个专栏收录

20 篇文章 0 订阅

订阅专栏

java

10 篇文章 0 订阅

订阅专栏

最长公共前缀
最长公共前缀

1.解法1

package LeetCode;

class Solution {
    public static void main(String[] args) {
        Solution s = new Solution();
        String[]strs={"flower","flow","flight"};
           String result=s.longestCommonPrefix(strs);
        System.out.println(result);

    }
    public String longestCommonPrefix(String[] strs) {
       if(strs==null||strs.length==0) return "";
       if(strs.length==1) return strs[0];

       String first=strs[0];           // strs = ["flower","flow","flight"]      strs[0]="flower"
       int max=first.length() -1;  //最后一个相同的char的index
        for (int i = 1; i <strs.length ; i++) {           //strs[1]="flow"
                    String curr=strs[i];
                    max=Math.min(curr.length()-1,max);    //"flower","flow"   选择较短的字符串
            for (int j = 0; j <=max ; j++) {             //j从0开始，j<=max
                if (curr.charAt(j) != first.charAt(j)) {

                    if (j == 0) {
                        return "";
                    } else {
                        max = j - 1;
                        break;
                    }


                }


            }
        }
        return  first.substring(0,max+1) ;   // [)，所以这里max+1

    }
}

解法2.Comparator

package LeetCode;

import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;

class Solution {
    public class  MyComparator implements Comparator<String>{

        @Override
        public int compare(String o1, String o2) {
            return o1.compareTo(o2);    //lexicographically ,按字典顺序
        }
    }
    public static void main(String[] args) {
        Solution s = new Solution();
        String[]strs={"flower","flow","flight"};
           String result=s.longestCommonPrefix(strs);
        System.out.println(result);

    }
    public String longestCommonPrefix(String[] strs) {
       if(strs==null||strs.length==0) return "";
       if(strs.length==1) return strs[0];
        Arrays.sort(strs,new MyComparator()) ;
        String first=strs[0],last=strs[strs.length-1];
        int len=Math.min(first.length(),last.length());
        for (int j=0;j<len;j++){
            if (first.charAt(j)!=last.charAt(j)){
                return  first.substring(0,j);  //不包含i, 因为i不等
            }
        }

//       String first=strs[0];           // strs = ["flower","flow","flight"]      strs[0]="flower"
//       int max=first.length() -1;  //最后一个相同的char的index
//        for (int i = 1; i <strs.length ; i++) {           //strs[1]="flow"
//                    String curr=strs[i];
//                    max=Math.min(curr.length()-1,max);    //"flower","flow"   选择较短的字符串
//            for (int j = 0; j <=max ; j++) {             //j从0开始，j<=max
//                if (curr.charAt(j) != first.charAt(j)) {
//
//                    if (j == 0) {
//                        return "";
//                    } else {
//                        max = j - 1;
//                        break;
//                    }

//
//                }
//
//
//            }
//        }
//        return  first.substring(0,max+1) ;   // [)，所以这里max+1
            return  first;
    }
}