【LeetCode】014. Longest Common Prefix

 1 class Solution {
 2 public:
 3     string longestCommonPrefix(vector<string>& strs) {
 4         int n = strs.size();
 5         if (n < 1 || strs[0].empty())
 6             return "";
 7         string res;
 8         
 9         for (int j = 0; j < strs[0].size(); ++j) {
10             char c = strs[0][j];
11             for (int i = 1; i < strs.size(); ++i) {
12                 if (j >= strs[i].size() || strs[i][j] != c)
13                     return res;
14             }
15             
16             res += c;
17         }
18         
19         return res;
20     }
21 };