[LeetCode]14. Longest Common Prefix(Easy)

Sherlock Chiou

·

Follow

Feb 19, 2021

--

Listen

Share

Description:

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.

Solution 1:

Time complexity O(S)，S stands for the strs List’s total number of characters . The worst case would be the strings in the List are all the same.