14. 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:

1 2	Input: strs = ["flower","flow","flight"] Output: "fl"

Example 2:

1
2
3

Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Constraints:

1
2
3

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

這篇要找相同子字串，先用*取得array內容
flower flow flight
zip取得每個位元切片
(‘f’, ‘f’, ‘f’)
(‘l’, ‘l’, ‘l’)
(‘o’, ‘o’, ‘i’)
再加set合併相同位元
{‘f’}
{‘l’}
{‘i’, ‘o’}
再回傳只有1位的
fl

如果你覺得這篇文章很棒，請你不吝點讚 (ﾟ∀ﾟ)