#include<iostream>
#include<string>
#include<vector>
using namespace std;
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int size = strs.size()-1;
int min_len = strs[0].length();
for(int i = 0; i<=size ; i++){
int len = strs[i].length();
if(min_len > len){
min_len = len;
}
}
int common_len = 0;
for(int j =0; j< min_len; j++){
for(int i=0; i<= size-1;i++){
if(strs[i][j]!=strs[i+1][j]){
return strs[0].substr(0,common_len);
}
else{
continue;
}
}
common_len ++;
cout << "common_len is:" << common_len << endl;
}
return strs[0].substr(0,common_len);
}
};
leetcode 14 Longest Common Prefix
最新推荐文章于 2020-05-24 10:35:28 发布