2023.5.8 Problem: 14. Longest Common Prefix

[umdreamer]

14. Longest Common Prefix Problem Link

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:

• 1 <= strs.length <= 200
• 0 <= strs[i].length <= 200
• strs[i] consists of only lowercase English letters.

[yeyuxq]

[tangyexi]

[zhjingyan]

[sjh397]

[cuixiao02]

[liu-si-han]

[wangshiqi7]

[12baoxingyu-6]

[daowuwu]

[PinkyLame]

[Lggg1234]

[zxm-1235]

[123lrb]

[liuhuanyu6]

[mafanjia]

[huangyumei1]

[syr2212061031]

[naqianqpg]

[htywan]

[ZWJ2212061008]

[foxbou]

[FXL1006]

[1125766961]

[promisewith7]

[bedauern]

[686xiaozhang]

[24zlx]

[xkqwww]

[xiaolu2002]

[zyhzxy99]

[shylieisme]

[zangfushuo]

[gusuning]