【LeetCode】Longest Common Prefix

Snowwolf_Yang

于 2014-05-24 19:44:43 发布

阅读量480

点赞数

分类专栏： LeetCode 字符串

本文链接：https://blog.csdn.net/snowwolf_yang/article/details/26861723

版权

LeetCode 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

字符串

11 篇文章 0 订阅

订阅专栏

参考链接

http://blog.csdn.net/algorithmengine/article/details/8258192

题目描述

Longest Common Prefix

Total Accepted: 10666 Total Submissions: 39462 My Submissions

Write a function to find the longest common prefix string amongst an array of strings.

题目分析

总结

代码示例

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        string res = "";
        
        if (strs.size() == 0) return res;
        
        res = strs[0];
        for (int i = 1; i < strs.size(); ++i)
        {
            int len = max(strs[i].size(), res.size());
            int j = 0;
            while (j < len)
            {
                if (strs[i][j] != res[j])
                    break;
                ++j;
            }
            
            res.erase(j, res.size() - j);
        }
        
        return res;
    }
};