Longest Common Prefix之Java实现
2019-05-27 00:16
1556 查看
一、题目
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: ["flower","flow","flight"]
Output: "fl"
Example 2:
Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Note:All given inputs are in lowercase letters a-z.
二、解题思路
1、获取数组的第一个元素firstStr作为比较的对象;
2、以firstStr的长度作为条件设定while循环;
3、从数组第二个元素开始遍历数组,判断每个元素是否已firstStr作为前缀;
4、如果不是,则截掉firstStr最后一个字符,再重新遍历数组进行比较。
三、代码实现
public String longestCommonPrefix(String[] strs) { if (strs.length == 0) { // 当数组长度为0时,返回空 return ""; } else if (strs.length == 1) { // 当数组只有一个元素时,则返回该元素 return strs[0]; } else { String firstStr = strs[0]; while (firstStr.length() != 0) { for (int i = 1; i < strs.length; i++) { if (strs[i].startsWith(firstStr)) { if (i == strs.length -1) { return firstStr; } continue; } else { // 从后往前一个一个截取 firstStr = firstStr.substring(0, firstStr.length() - 1); break; } } } } return ""; }
相关文章推荐
- 【LeetCode-面试算法经典-Java实现】【014-Longest Common Prefix(最长公共前缀)】
- [LeetCode][14]Longest Common Prefix解析 两种算法和底层源码的深入对比-Java实现
- [LeetCode] 014. Longest Common Prefix (Easy) (C++/Java/Python)
- Java [leetcode 14] Longest Common Prefix
- LeetCode 14 : Longest Common Prefix (Java)
- [LeetCode][Java] Longest Common Prefix
- Longest Common Prefix Leetcode Python Java
- 【小熊刷题】Longest Common Prefix <Leetcode 14, Java>
- LeetCode : Longest Common Prefix [java]
- leetcode:java.T014_LongestCommonPrefix--写一个函数找出一个字串所数组中的最长的公共前缀
- LeetCode-14-Longest Common Prefix(C语言实现)
- Longest Common Prefix leetcode java
- 【leetcode-14】Longest Common Prefix(java)
- Longest Common Prefix (Java)
- leetcode:Longest Common Prefix 【Java】
- LEEDCODE 14 Longest Common Prefix (JAVA题解)
- leetcode解题之14# Longest Common Prefix Java版 两种方法实现
- LeetCode 14 : Longest Common Prefix (Java)
- Leetcode 细节实现 Longest Common Prefix
- 最长公共子序列(Longest Common Subsequence) 算法的Java实现