leetcode:Longest Common Prefix [14]

来源:互联网 发布:银行程序员怎么样 编辑:程序博客网 时间:2024/05/03 09:25

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 "";if (strs.size() == 1) return strs[0];string s = strs[0];int j;for (int i = 1; i < strs.size(); i++) {for (j = 0; j < strs[0].length() && j < strs[i].length(); j++) {if (strs[0].at(j) == strs[i].at(j)) {}else break;}if (j < s.length()) {s = strs[0].substr(0, j);}}return s;}};



0 0
原创粉丝点击