leetcode14

最新推荐文章于 2024-08-18 17:42:31 发布

Ekinnn

最新推荐文章于 2024-08-18 17:42:31 发布

阅读量394

点赞数

分类专栏： bj+string 文章标签： string leetcode

本文链接：https://blog.csdn.net/ekinnn/article/details/53912934

版权

bj+string 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

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

1、string substr (size_t pos = 0, size_t len = npos) const;
Returns a newly constructed string object with its value initialized to a copy of a substring of this object.

The substring is the portion of the object that starts at character position pos and spans len characters.

pos: Position of the first character to be copied as a substring.
len: Number of characters to include in the substring.
小例子~

std::string str="We think in generalities, but we live in details.";                                       
std::string str2 = str.substr (3,5);     // "think"