14. Longest Common Prefix（最长公共前缀）（leetcode)

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.

分析：我之前自己写的代码运行总是不通过。深感受挫，基础知识太差，好多函数都不知道。

方法一：水平扫描