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

Subscribe?to see which companies asked this question

?就是比較vector<string>中，從頭開始字符串相同的部分。。

就是第一個字符串和下面的進(jìn)行比較，取相同的部分。

class Solution { public:string longestCommonPrefix(vector<string> &strs) {if (strs.size() == 0)return "";string temp = strs[0];for (int i = 1; i < strs.size(); ++i){if (temp.length() == 0 || strs[i].length() == 0)return "";int len = temp.length() < strs[i].length() ? temp.length() : strs[i].length();int j;for (j = 0; j < len; ++j){if (temp[j] != strs[i][j]) ?break;}temp = temp.substr(0,j);}return temp;} };

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

總結(jié)

以上是生活随笔為你收集整理的Longest Common Prefix的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。