题目描述
编写一个函数来查找字符串数组中的最长公共前缀。如果不存在公共前缀,返回空字符串 “”。
示例 1:
- 输入:strs = [“flower”,“flow”,“flight”]
- 输出:“fl”
示例 2:
- 输入:strs = [“dog”,“racecar”,“car”]
- 输出:""
题目来源
题目解析
package com.wy.leetCode; /** * @author HelloWorld * @create 2021/10/19 21:01 * @email 154803771@qq.com */ public class LongestCommonPrefix { public static void main(String[] args) { System.out.println(longestCommonPrefix(new String[]{"aa","aa"})); } public static String longestCommonPrefix(String[] strs) { if (strs.length == 1) { return strs[0]; } String result = ""; String first = strs[0]; int j = 0; for (int i = 1; i < strs.length; ) { if (j < strs[i].length() && j < first.length() && strs[i].charAt(j) == first.charAt(j)){ if (i == strs.length - 1){ i = 1; result += first.charAt(j); j++; }else { i++; } }else { break; } } return result; } }