[14] Longest Common Prefix

Published on in LeetCode with 0 views and 0 comments

题目

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.

解法

一

思路

从上到下，从左到右遍历

代码

LeetCode-14-1.png

二

思路

先进行排序，再比较第一个和最后一个，获取共同前缀

代码

LeetCode-14-2.png


↑ ↓