leetcode_014_Longest Common Prefix

一定注意要判断vector是否为空，其余没什么好说的

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