LeetCode - Easy - 14. Longest Common Prefix

Topic

String

Description

https://leetcode.com/problems/longest-common-prefix/

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.

Constraints:

0 <= strs.length <= 200
0 <= strs[i].length <= 200
strs[i] consists of only lower-case English letters.

Analysis

略

Submission

public class LongestCommonPrefix {// 方法一：我写的public String longestCommonPrefix1(String[] strs) {if (strs == null || strs.length == 0)return "";StringBuilder sb = new StringBuilder();out: for (int i = 0; i < strs[0].length(); i++) {char current = strs[0].charAt(i);for (int j = 1; j < strs.length; j++) {if (strs[j].length() == i || strs[j].charAt(i) != current)break out;}sb.append(current);}return sb.toString();}// 方法二：public String longestCommonPrefix2(String[] strs) {if (strs == null || strs.length == 0)return "";for (int i = 0; i < strs[0].length(); i++) {char current = strs[0].charAt(i);for (int j = 1; j < strs.length; j++) {if (strs[j].length() == i || strs[j].charAt(i) != current)return strs[0].substring(0, i);}}return strs[0];}// 方法三：public String longestCommonPrefix3(String[] strs) {if (strs == null)return null;if (strs.length == 0)return "";String theShortest = strs[0], theLongest = strs[0];for (String str : strs) {if (str.compareTo(theShortest) < 0)theShortest = str;if (str.compareTo(theLongest) > 0)theLongest = str;}int i = 0;while (i < theShortest.length() && theShortest.charAt(i) == theLongest.charAt(i))i++;return theShortest.substring(0, i);
}

Test

import static org.junit.Assert.*;
import org.junit.Test;public class LongestCommonPrefixTest {@Testpublic void test() {LongestCommonPrefix obj = new LongestCommonPrefix();final String[] array1 = {"flower", "flow", "flight"};assertEquals("fl", obj.longestCommonPrefix1(array1));assertEquals("fl", obj.longestCommonPrefix2(array1));assertEquals("fl", obj.longestCommonPrefix3(array1));final String[] array2 = {"dog", "racecar", "car"};assertEquals("", obj.longestCommonPrefix1(array2));assertEquals("", obj.longestCommonPrefix2(array2));assertEquals("", obj.longestCommonPrefix3(array2));}
}

LeetCode - Easy - 14. Longest Common Prefix相关推荐

【easy!】LeetCode 14. Longest Common Prefix
LeetCode 14. Longest Common Prefix Solution1: 用的暴力遍历,时间复杂度O(n2)O(n2)O(n^2) class Solution { public:s ...
LeetCode算法入门- Longest Common Prefix -day13
LeetCode算法入门- Longest Common Prefix -day13 题目描述: Write a function to find the longest common prefix ...
LeetCode 14. Longest Common Prefix字典树 trie树学习之公共前缀字符串
所有字符串的公共前缀最长字符串特点:(1)公共所有字符串前缀 (好像跟没说一样...) (2)在字典树中特点:任意从根节点触发遇见第一个分支为止的字符集合即为目标串参考问题:https://lee ...
leetcode python3 简单题14. Longest Common Prefix
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第十四题 (1)题目英文: Write a function to find th ...
LeetCode:14. Longest Common Prefix
两年硕士超快的鸭,又要准备秋招啦!0508第一题~ 题目 Write a function to find the longest common prefix string amongst an ar ...
Leet Code OJ 14. Longest Common Prefix [Difficulty: Easy]
题目: Write a function to find the longest common prefix string amongst an array of strings. 翻译: 写一个函数 ...
LeetCode: 14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 大意就是,写一个函数可以找 ...
【LeetCode】15.Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 从字符数组的第一项往后挨个 ...
LeetCode in Python-14. Longest Common Prefix 最长公共前缀
Longest Common Prefix 最长公共前缀题目解法1.逐位比较解法2.利用集合性质解法3.zip+sets 解法4.借助os模块自带函数... 出处题目解法1.逐位比较 cl ...