Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

先找到最短的，然后一个一个的进行计较。

class Solution {public:string longestCommonPrefix(vector<string>& strs) {if (strs.size() == 0)return "";string res = "";int minL = strs[0].size();int index = 0;for (int i = 1; i < strs.size(); ++i){if (strs[i].size() < minL){minL = strs[i].size();index = i;}}for (int i = 0; i < minL; ++i){for (int j = 0; j < strs.size(); ++j){if (j == index)continue;if (strs[index][i] != strs[j][i])return res;}res += strs[index][i];}return res;}};