[LeetCode] Longest Common Prefix

来源:互联网 发布:网络监管员是做什么的 编辑:程序博客网 时间:2024/04/30 09:50

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


0 0
原创粉丝点击