[leetcode] Python(7)--验证回文串(125)、字符串转换整数 (atoi)(8)、实现strStr()(28)、报数(38)、最长公共前缀(14)

最新推荐文章于 2022-03-30 18:16:06 发布
最新推荐文章于 2022-03-30 18:16:06 发布
阅读量279 收藏
点赞数 2
分类专栏： leetcode算法 文章标签： leetcode 算法 python
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qweqwrqw/article/details/89163402
版权

从零开始的力扣（第七天）~

1.验证回文串

给定一个字符串，验证它是否是回文串，只考虑字母和数字字符，可以忽略字母的大小写。

说明：本题中，我们将空字符串定义为有效的回文串。

示例 1:
输入: “A man, a plan, a canal: Panama”
输出: true

示例 2:
输入: “race a car”
输出: false
—————————————————————————————————————————

先在字符串中检测字母与数字，再进行翻转验证
class Solution:
    def isPalindrome(self, s: str) -> bool:
        ss = ''.join(filter(str.isalnum, str(s)))
        return ss[::-1].lower() == ss.lower()

在这里插入图片描述
下面说一下滤波器内的函数意义：

ss = ''.join(filter(str.isalnum, str(s)))

filter()函数为滤波器函数，第一个输入值为判断语句，第二个输入值为需要判断的内容，其中str.isalnum为判断输入是否为字母或数字。

注意后面的str(s)，如果不加str()做限定，那么题目中的s是unicode字符，python 2中不能编译，但是在python 3中可以不加str()。

直接在原字符串内判断，在过程中忽略掉符号与空格
class Solution(object):
    def isPalindrome(self, s):
        """
        :type s: str
        :rtype: bool
        """
        s_length = len(s)
        if s_length <= 1:
            return True
        
        i = 0
        j = s_length - 1
        
        while i <= j:
            while (s[i].isalpha() != True and s[i].isdigit() != True) and i < j:
                i = i + 1
            
            while (s[j].isalpha() != True and s[j].isdigit() != True) and j > i:
                j = j - 1
            
            if s[i].lower() != s[j].lower():
                return False
            else:
                i = i + 1
                j = j - 1
        
        return True

在这里插入图片描述
其中isalpha()为判断是否为字母，isdigit()判断是否为数字。

2.字符串转换整数 (atoi)

请你来实现一个 atoi 函数，使其能将字符串转换成整数。

首先，该函数会根据需要丢弃无用的开头空格字符，直到寻找到第一个非空格的字符为止。

当我们寻找到的第一个非空字符为正或者负号时，则将该符号与之后面尽可能多的连续数字组合起来，作为该整数的正负号；假如第一个非空字符是数字，则直接将其与之后连续的数字字符组合起来，形成整数。

该字符串除了有效的整数部分之后也可能会存在多余的字符，这些字符可以被忽略，它们对于函数不应该造成影响。

注意：假如该字符串中的第一个非空格字符不是一个有效整数字符、字符串为空或字符串仅包含空白字符时，则你的函数不需要进行转换。

在任何情况下，若函数不能进行有效的转换时，请返回 0。

说明：

假设我们的环境只能存储 32 位大小的有符号整数，那么其数值范围为 [−231, 231 − 1]。如果数值超过这个范围，请返回 INT_MAX (231 − 1) 或 INT_MIN (−231) 。

示例 1:
输入: “42”
输出: 42

示例 2:
输入: " -42"
输出: -42
解释: 第一个非空白字符为 ‘-’, 它是一个负号。我们尽可能将负号与后面所有连续出现的数字组合起来，最后得到 -42 。

示例 3:
输入: “4193 with words”
输出: 4193
解释: 转换截止于数字 ‘3’ ，因为它的下一个字符不为数字。

示例 4:
输入: “words and 987”
输出: 0
解释: 第一个非空字符是 ‘w’, 但它不是数字或正、负号，因此无法执行有效的转换。

示例 5:
输入: “-91283472332”
输出: -2147483648
解释: 数字 “-91283472332” 超过 32 位有符号整数范围，因此返回 INT_MIN (−231) 。
—————————————————————————————————————————

通过遍历所有情况，得出所有情况的结果
class Solution(object):
    def myAtoi(self, str):
        """
        :type str: str
        :rtype: int
        """
        List = list(str.lstrip())
        num = []
        neg = []
        i = 0
        n = 1
        if not List:
            return 0

        if List[0].isdigit():
            while i < len(List) and List[i].isdigit():
                num.append(List[i])
                i += 1
        else:     
            if List[0] == "-":
                neg.append(1)
                while n < len(List) and List[n].isdigit():
                    num.append(List[n])
                    n += 1
            elif List[0] == "+":
                while n < len(List) and List[n].isdigit():
                    num.append(List[n])
                    n += 1
        number = int(''.join(num) if num else 0)
        number = -number if neg else number
        if number < - 2 ** 31:
            return -2147483648
        if number > 2 ** 31 - 1:
            return 2147483647
        return number

在这里插入图片描述
这题是真的折磨人，每一次输出结果就看到例子里有不符合情况的，到最后都快崩溃了?，最后找到了一个比较好的解法：

  1. 先将左边空格全部去掉，使用lstrip()函数；
  2. 通过判断，第一位数字只有四种情况：正、负、其他字符与数字，对数字与其他情况分别看待，有正负号时从第二位开始寻找数字，并在非数字处停止循环，记住负号时要给一个负值。
通过找寻所有正则情况，这个方法是真的简单，就是比较难操作
class Solution(object):
    def myAtoi(self, str):
        """
        :type str: str
        :rtype: int
        """
        a = re.findall(r'^[-+]?\d+', str.strip()) 
        if not a:
            return 0
        a = int(a[0])
        b = 2**31
        if a > b-1:
            return b-1
        elif a < -b:
            return -b
        else:
            return a

在这里插入图片描述
其中最重要的就是使用re.findall()正则化函数，它返回string中所有与pattern相匹配的全部字串，返回形式为数组：

findall(pattern, string, flags=0)

这里有一个比较完整的re.findall()函数使用介绍：https://zhuanlan.zhihu.com/p/37900841、http://funhacks.net/2016/12/27/regular_expression/

3.实现strStr()

实现 strStr() 函数。
给定一个 haystack 字符串和一个 needle 字符串，在 haystack 字符串中找出 needle 字符串出现的第一个位置 (从0开始)。如果不存在，则返回 -1。

示例 1:
输入: haystack = “hello”, needle = “ll”
输出: 2

示例 2:
输入: haystack = “aaaaa”, needle = “bba”
输出: -1

说明:
当 needle 是空字符串时，我们应当返回什么值呢？这是一个在面试中很好的问题。
对于本题而言，当 needle 是空字符串时我们应当返回 0 。这与C语言的 strstr() 以及 Java的 indexOf() 定义相符。
—————————————————————————————————————————

使用内置find()函数
class Solution(object):
    def strStr(self, haystack, needle):
        """
        :type haystack: str
        :type needle: str
        :rtype: int
        """
        return haystack.find(needle)

在这里插入图片描述

依次循环找到haystack内符合条件的第一次位置
class Solution(object):
    def strStr(self, haystack, needle):
        """
        :type haystack: str
        :type needle: str
        :rtype: int
        """
        len1 = len(haystack)
        len2 = len(needle)
        if len2 == 0:
            return 0
        for i in range(len1):
            if haystack[i:i+len2] == needle:
                return i
            else:
                continue
        return -1

在这里插入图片描述

4.报数

报数序列是一个整数序列，按照其中的整数的顺序进行报数，得到下一个数。其前五项如下：

1.     1
2.     11
3.     21
4.     1211
5.     111221

1 被读作 “one 1” (“一个一”) , 即 11。
11 被读作 “two 1s” (“两个一”）, 即 21。
21 被读作 “one 2”, “one 1” （“一个二” , “一个一”) , 即 1211。

给定一个正整数 n（1 ≤ n ≤ 30），输出报数序列的第 n 项。

注意：整数顺序将表示为一个字符串。

示例 1:
输入: 1
输出: “1”

示例 2:
输入: 4
输出: “1211”
—————————————————————————————————————————

通过递归的思想，将前n - 1项依次递归，通过建立字典，把一次中连续的个数与数字在字典内保存，再输出
class Solution(object):
    def countAndSay(self, n):
        """
        :type n: int
        :rtype: str
        """
        if n == 1:
            return str(1)
        last = self.countAndSay(n-1)
        List = []
        d = {}
        d[last[-1]] = 0
        for i in range(len(last) - 1):
            if last[i] not in d:
                d[last[i]] = 1
            else:
                d[last[i]] += 1
            if last[i] != last[i + 1]:
                List.append(d[last[i]])
                List.append(last[i])
                d[last[i]] = 0
        if d[last[-1]] != 0:
            List.append(d[last[-1]] + 1)
            List.append(last[i])
        else:
            List.append(1)
            List.append(last[-1])
        return ''.join([str(i) for i in List])

在这里插入图片描述
总感觉写的比较繁琐，本来想的是对列表内连续数字切片，但是实际操作比较麻烦。

来看看大神的解法?
class Solution(object):
    def countAndSay(self, n):
        """
        :type n: int
        :rtype: str
        """
        dict = {
        1:"1",
		2:"11",
		3:"21",
		4:"1211",
		5:"111221",
		6:"312211",
		7:"13112221",
		8:"1113213211",
		9:"31131211131221",
		10:"13211311123113112211",
		11:"11131221133112132113212221",
		12:"3113112221232112111312211312113211",
		13:"1321132132111213122112311311222113111221131221",
		14:"11131221131211131231121113112221121321132132211331222113112211",
		15:"311311222113111231131112132112311321322112111312211312111322212311322113212221",
		16:"132113213221133112132113311211131221121321131211132221123113112221131112311332111213211322211312113211",
		17:"11131221131211132221232112111312212321123113112221121113122113111231133221121321132132211331121321231231121113122113322113111221131221",
		18:"31131122211311123113321112131221123113112211121312211213211321322112311311222113311213212322211211131221131211132221232112111312111213111213211231131122212322211331222113112211",
		19:"1321132132211331121321231231121113112221121321132122311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112311332111213122112311311123112111331121113122112132113213211121332212311322113212221",
		20:"11131221131211132221232112111312111213111213211231132132211211131221131211221321123113213221123113112221131112311332211211131221131211132211121312211231131112311211232221121321132132211331121321231231121113112221121321133112132112312321123113112221121113122113121113123112112322111213211322211312113211",
		21:"311311222113111231133211121312211231131112311211133112111312211213211312111322211231131122211311122122111312211213211312111322211213211321322113311213212322211231131122211311123113223112111311222112132113311213211221121332211211131221131211132221232112111312111213111213211231132132211211131221232112111312211213111213122112132113213221123113112221131112311311121321122112132231121113122113322113111221131221",
		22:"132113213221133112132123123112111311222112132113311213211231232112311311222112111312211311123113322112132113213221133122112231131122211211131221131112311332211211131221131211132221232112111312111213322112132113213221133112132113221321123113213221121113122123211211131221222112112322211231131122211311123113321112131221123113111231121113311211131221121321131211132221123113112211121312211231131122211211133112111311222112111312211312111322211213211321322113311213211331121113122122211211132213211231131122212322211331222113112211",
		23:"111312211312111322212321121113121112131112132112311321322112111312212321121113122112131112131221121321132132211231131122211331121321232221121113122113121113222123112221221321132132211231131122211331121321232221123113112221131112311332111213122112311311123112112322211211131221131211132221232112111312211322111312211213211312111322211231131122111213122112311311221132211221121332211213211321322113311213212312311211131122211213211331121321123123211231131122211211131221131112311332211213211321223112111311222112132113213221123123211231132132211231131122211311123113322112111312211312111322212321121113122123211231131122113221123113221113122112132113213211121332212311322113212221",
		24:"3113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112311332111213213211221113122113121113222112132113213221232112111312111213322112132113213221133112132123123112111311222112132113311213211221121332211231131122211311123113321112131221123113112221132231131122211211131221131112311332211213211321223112111311222112132113212221132221222112112322211211131221131211132221232112111312111213111213211231132132211211131221232112111312211213111213122112132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211132221121311121312211213211312111322211213211321322113311213212322211231131122211311123113321112131221123113112211121312211213211321222113222112132113223113112221121113122113121113123112112322111213211322211312113211",
		25:"132113213221133112132123123112111311222112132113311213211231232112311311222112111312211311123113322112132113212231121113112221121321132132211231232112311321322112311311222113111231133221121113122113121113221112131221123113111231121123222112132113213221133112132123123112111312111312212231131122211311123113322112111312211312111322111213122112311311123112112322211211131221131211132221232112111312111213111213211231132132211211131221232112111312212221121123222112132113213221133112132123123112111311222112132113213221132213211321322112311311222113311213212322211211131221131211221321123113213221121113122113121132211332113221122112133221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112212211131221121321131211132221123113112221131112311332211211133112111311222112111312211311123113322112111312211312111322212321121113121112133221121321132132211331121321231231121113112221121321132122311211131122211211131221131211322113322112111312211322132113213221123113112221131112311311121321122112132231121113122113322113111221131221",
		26:"1113122113121113222123211211131211121311121321123113213221121113122123211211131221121311121312211213211321322112311311222113311213212322211211131221131211221321123113213221121113122113121113222112131112131221121321131211132221121321132132211331121321232221123113112221131112311322311211131122211213211331121321122112133221121113122113121113222123211211131211121311121321123113111231131122112213211321322113311213212322211231131122211311123113223112111311222112132113311213211221121332211231131122211311123113321112131221123113111231121113311211131221121321131211132221123113112211121312211231131122113221122112133221121113122113121113222123211211131211121311121321123113213221121113122113121113222113221113122113121113222112132113213221232112111312111213322112311311222113111221221113122112132113121113222112311311222113111221132221231221132221222112112322211213211321322113311213212312311211131122211213211331121321123123211231131122211211131221131112311332211213211321223112111311222112132113213221123123211231132132211231131122211311123113322112111312211312111322111213122112311311123112112322211213211321322113312211223113112221121113122113111231133221121321132132211331121321232221123123211231132132211231131122211331121321232221123113112221131112311332111213122112311311123112112322211211131221131211132221232112111312111213111213211231132132211211131221131211221321123113213221123113112221131112211322212322211231131122211322111312211312111322211213211321322113311213211331121113122122211211132213211231131122212322211331222113112211",
		27:"31131122211311123113321112131221123113111231121113311211131221121321131211132221123113112211121312211231131122211211133112111311222112111312211312111322211213211321322123211211131211121332211231131122211311122122111312211213211312111322211231131122211311123113322112111331121113112221121113122113111231133221121113122113121113222123211211131211121332211213211321322113311213211322132112311321322112111312212321121113122122211211232221123113112221131112311332111213122112311311123112111331121113122112132113311213211321222122111312211312111322212321121113121112133221121321132132211331121321132213211231132132211211131221232112111312212221121123222112132113213221133112132123123112111311222112132113311213211231232112311311222112111312211311123113322112132113212231121113112221121321132122211322212221121123222112311311222113111231133211121312211231131112311211133112111312211213211312111322211231131122211311123113322113223113112221131112311332211211131221131211132211121312211231131112311211232221121321132132211331221122311311222112111312211311123113322112132113213221133122211332111213112221133211322112211213322112111312211312111322212321121113121112131112132112311321322112111312212321121113122112131112131221121321132132211231131122211331121321232221121113122113121122132112311321322112111312211312111322211213111213122112132113121113222112132113213221133112132123222112311311222113111231132231121113112221121321133112132112211213322112111312211312111322212311222122132113213221123113112221133112132123222112111312211312111322212321121113121112133221121311121312211213211312111322211213211321322123211211131211121332211213211321322113311213212312311211131122211213211331121321122112133221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311222113111221221113122112132113121113222112132113213221133122211332111213322112132113213221132231131122211311123113322112111312211312111322212321121113122123211231131122113221123113221113122112132113213211121332212311322113212221",
		28:"13211321322113311213212312311211131122211213211331121321123123211231131122211211131221131112311332211213211321223112111311222112132113213221123123211231132132211231131122211311123113322112111312211312111322111213122112311311123112112322211213211321322113312211223113112221121113122113111231133221121321132132211331121321232221123123211231132132211231131122211331121321232221123113112221131112311332111213122112311311123112112322211211131221131211132221232112111312211322111312211213211312111322211231131122111213122112311311221132211221121332211213211321322113311213212312311211131122211213211331121321123123211231131122211211131221232112111312211312113211223113112221131112311332111213122112311311123112112322211211131221131211132221232112111312211322111312211213211312111322211231131122111213122112311311221132211221121332211211131221131211132221232112111312111213111213211231132132211211131221232112111312211213111213122112132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211322113321132211221121332211213211321322113311213212312311211131122211213211331121321123123211231131122211211131221131112311332211213211321322113311213212322211322132113213221133112132123222112311311222113111231132231121113112221121321133112132112211213322112111312211312111322212311222122132113213221123113112221133112132123222112111312211312111322212311322123123112111321322123122113222122211211232221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112212211131221121321131211132221123113112221131112311332211211133112111311222112111312211311123113322112111312211312111322212321121113121112133221121321132132211331121321132213211231132132211211131221232112111312212221121123222112311311222113111231133211121321321122111312211312111322211213211321322123211211131211121332211231131122211311123113321112131221123113111231121123222112111331121113112221121113122113111231133221121113122113121113221112131221123113111231121123222112111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321133112132112312321123113112221121113122113111231133221121321132132211331221122311311222112111312211311123113322112111312211312111322212311322123123112112322211211131221131211132221132213211321322113311213212322211231131122211311123113321112131221123113112211121312211213211321222113222112132113223113112221121113122113121113123112112322111213211322211312113211",
		29:"11131221131211132221232112111312111213111213211231132132211211131221232112111312211213111213122112132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211132221121311121312211213211312111322211213211321322113311213212322211231131122211311123113223112111311222112132113311213211221121332211211131221131211132221231122212213211321322112311311222113311213212322211211131221131211132221232112111312111213322112131112131221121321131211132221121321132132212321121113121112133221121321132132211331121321231231121113112221121321133112132112211213322112311311222113111231133211121312211231131122211322311311222112111312211311123113322112132113212231121113112221121321132122211322212221121123222112111312211312111322212321121113121112131112132112311321322112111312212321121113122112131112131221121321132132211231131122111213122112311311222113111221131221221321132132211331121321231231121113112221121321133112132112211213322112311311222113111231133211121312211231131122211322311311222112111312211311123113322112132113212231121113112221121321132122211322212221121123222112311311222113111231133211121312211231131112311211133112111312211213211312111322211231131122111213122112311311222112111331121113112221121113122113121113222112132113213221232112111312111213322112311311222113111221221113122112132113121113222112311311222113111221132221231221132221222112112322211211131221131211132221232112111312111213111213211231132132211211131221232112111312211213111213122112132113213221123113112221133112132123222112111312211312111322212321121113121112133221132211131221131211132221232112111312111213322112132113213221133112132113221321123113213221121113122123211211131221222112112322211231131122211311123113321112132132112211131221131211132221121321132132212321121113121112133221123113112221131112311332111213211322111213111213211231131211132211121311222113321132211221121332211213211321322113311213212312311211131122211213211331121321123123211231131122211211131221131112311332211213211321223112111311222112132113213221123123211231132132211231131122211311123113322112111312211312111322111213122112311311123112112322211213211321322113312211223113112221121113122113111231133221121321132132211331121321232221123123211231132132211231131122211331121321232221123113112221131112311332111213122112311311123112112322211211131221131211132221232112111312211322111312211213211312111322211231131122111213122112311311221132211221121332211213211321322113311213212312311211131211131221223113112221131112311332211211131221131211132211121312211231131112311211232221121321132132211331121321231231121113112221121321133112132112211213322112312321123113213221123113112221133112132123222112311311222113111231132231121113112221121321133112132112211213322112311311222113111231133211121312211231131112311211133112111312211213211312111322211231131122111213122112311311221132211221121332211211131221131211132221232112111312111213111213211231132132211211131221232112111312211213111213122112132113213221123113112221133112132123222112111312211312111322212311222122132113213221123113112221133112132123222112311311222113111231133211121321132211121311121321122112133221123113112221131112311332211322111312211312111322212321121113121112133221121321132132211331121321231231121113112221121321132122311211131122211211131221131211322113322112111312211322132113213221123113112221131112311311121321122112132231121113122113322113111221131221",
		30:"3113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112212211131221121321131211132221123113112221131112311332211211133112111311222112111312211311123113322112111312211312111322212321121113121112133221121321132132211331121321132213211231132132211211131221232112111312212221121123222112311311222113111231133211121321321122111312211312111322211213211321322123211211131211121332211231131122211311123113321112131221123113111231121123222112111331121113112221121113122113111231133221121113122113121113221112131221123113111231121123222112111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321132132211322132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211322113321132211221121332211231131122211311123113321112131221123113111231121113311211131221121321131211132221123113112211121312211231131122211211133112111311222112111312211312111322211213211321223112111311222112132113213221133122211311221122111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321132132211322132113213221123113112221133112132123222112111312211312112213211231132132211211131221131211322113321132211221121332211213211321322113311213212312311211131122211213211331121321123123211231131122211211131221131112311332211213211321223112111311222112132113213221123123211231132132211231131122211311123113322112111312211312111322111213122112311311123112112322211213211321322113312211223113112221121113122113111231133221121321132132211331222113321112131122211332113221122112133221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112311332111213122112311311123112112322211322311311222113111231133211121312211231131112311211232221121113122113121113222123211211131221132211131221121321131211132221123113112211121312211231131122113221122112133221121321132132211331121321231231121113121113122122311311222113111231133221121113122113121113221112131221123113111231121123222112132113213221133112132123123112111312211322311211133112111312211213211311123113223112111321322123122113222122211211232221121113122113121113222123211211131211121311121321123113213221121113122123211211131221121311121312211213211321322112311311222113311213212322211211131221131211221321123113213221121113122113121113222112131112131221121321131211132221121321132132211331121321232221123113112221131112311322311211131122211213211331121321122112133221121113122113121113222123112221221321132132211231131122211331121321232221121113122113121113222123211211131211121332211213111213122112132113121113222112132113213221232112111312111213322112132113213221133112132123123112111311222112132113311213211221121332211231131122211311123113321112131221123113112221132231131122211211131221131112311332211213211321223112111311222112132113212221132221222112112322211211131221131211132221232112111312111213111213211231131112311311221122132113213221133112132123222112311311222113111231132231121113112221121321133112132112211213322112111312211312111322212321121113121112131112132112311321322112111312212321121113122122211211232221121311121312211213211312111322211213211321322123211211131211121332211213211321322113311213211322132112311321322112111312212321121113122122211211232221121321132132211331121321231231121113112221121321133112132112312321123113112221121113122113111231133221121321132122311211131122211213211321222113222122211211232221123113112221131112311332111213122112311311123112111331121113122112132113121113222112311311221112131221123113112221121113311211131122211211131221131211132221121321132132212321121113121112133221123113112221131112311332111213213211221113122113121113222112132113213221232112111312111213322112132113213221133112132123123112111312211322311211133112111312212221121123222112132113213221133112132123222113223113112221131112311332111213122112311311123112112322211211131221131211132221232112111312111213111213211231132132211211131221131211221321123113213221123113112221131112211322212322211231131122211322111312211312111322211213211321322113311213211331121113122122211211132213211231131122212322211331222113112211"}
        return dict[n]

在这里插入图片描述
哈哈哈，供君一乐！

5.最长公共前缀

编写一个函数来查找字符串数组中的最长公共前缀。如果不存在公共前缀，返回空字符串 “”。

示例 1:
输入: [“flower”,“flow”,“flight”]
输出: “fl”

示例 2:
输入: [“dog”,“racecar”,“car”]
输出: “”
解释: 输入不存在公共前缀。

说明:
所有输入只包含小写字母 a-z 。
—————————————————————————————————————————

最初的想法是找出列表内最短的字符串作为比较字符串，通过之后的字符串与初字符串取交集得到更新字符串，这样循环
class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        if not strs:
            return ""
        new_list = [len(d) for d in strs]
        index = new_list.index(min(new_list))
        temp = strs[index]
        for i in range(len(strs)):
            for j,x in enumerate(temp):
                if x != strs[i][j]:
                    temp = temp[:j]
        return temp

在这里插入图片描述
但是这种方法遍历时间比较长，时间复杂度较高

比较奇特的方法，通过比较所有的字符串ASCII码找出最小与最大的，查看两者的交集就可以
class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        if not strs: return ""
        s1 = min(strs)
        s2 = max(strs)
        for i,x in enumerate(s1):
            if x != s2[i]:
                return s2[:i]
        return s1

在这里插入图片描述
非常巧妙的方法，因为ASCII码比较时是从前向后查找的，所以最大与最小的就是相差最多的。

又一个精彩操作：利用python的zip函数，把str看成list然后把输入看成二维数组，左对齐纵向压缩，然后把每项利用集合去重，之后遍历list中找到元素长度大于1之前的就是公共前缀
class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        if not strs: return ""
        ss = list(map(set, zip(*strs)))
        res = ""
        for i, x in enumerate(ss):
            x = list(x)
            if len(x) > 1:
                break
            res = res + x[0]
        return res

在这里插入图片描述

以上就是今日经验！

gogogo！
关注
  • 2
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
(C++)报数问题
m0_61219098的博客
01-20 516
输入指定），则该号人员被“淘汰出局”；接着仍沿顺时针方向从被淘汰出局者的下一人员又重新从1开始数起，数到k后，淘汰第2个人；如此继续，直到最后剩下一个人时停止。输出先后被“淘汰”的人的编号。有n人围坐成一圈（假设他们的编号沿顺时针方向依次为1到n）。编程序，使用数组来存放各数据（人员编号），而后从1号人员开始数起（沿顺时针方向），当数到k时（其中k>1由用户通过。特点：采用指针算法，效率比利用取余运算更高。结果：输出了淘汰顺序和胜出者。
C++实现报数
qq_42384665的博客
05-15 1445
小明和小亮玩报数游戏，小明从1到5报数（即报1 2 3 4 5），小亮从1到10报数（即报1 2 3 4 5 6 7 8 9 10）。若两人同时开始，并以同样的速度报数，不停重复。当两人都报了100个数时，编程计算，两个人同时报相同数的次数是多少。 #include<iostream> using namespace std; int main() { int h,m,n,i=0,x=0; do { m=i%5+1; h=i%10+1; if(m==h)x++;
【CCF】201912-1-报数(c++)
weixin_44771252的博客
12-04 100
【CCF】201912-1-报数(c++) 代码长度 1.991KB 编程语言 C++ 评测结果 正确 得分 100 时间使用 31ms 空间使用 2.839MB 代码写的有点啰嗦，，，但是挺好理解，不过题目也挺好理解的。 #include<iostream> using namespace std; #include<string> #include<sstream> void test() { int n; cin >> n;
CCF CSP 报数 C++
Alfrank的博客
03-30 171
报数 #include<bits/stdc++.h> using namespace std; bool check(int i){ if(i % 7 ==0){ return false; } else { while(i){ if(i % 10 == 7){ return false; } i /= 10; } } return true; } int main(){ int n; cin>>n; int a[5] = {
（每日一练c++）报数游戏
biyesheji1000的专栏
02-16 4267
报数游戏 贡献者：weixin_45808110 题目描述 报数游戏 首先，会给他们一人一个编号，并且每个人的编号都不相同。接下来的每一回合，会给一个数，编号超过它的最小编号的人要报出自己的编号。如果没有人的编号比给出的数要大，那么编号最大的人要报出自己的编号。每个人可以重复报号。 会按照一个列表顺次报出每个回合的数，朋友们想知道每回合报出的编号应该是多少。输入 输入数据共 3行。 第一行有两个整数 n,m(1≤n≤100,000,1≤m≤100,000)，分别表示参与游戏的朋友的个数，和游戏的回合..
python-leetcode题解之第680题验证回文串II
最新发布
07-09
python python_leetcode题解之第680题验证回文串II
zwangZJU#LeetCode-in-python-wznote#LeetCode-python-8-字符串转换整数-(at
07-25
1.去除字符串头尾空格 2.判断符号 3.提取出数字字符直到第一个不为数字的字符 4.字符串转整数，乘以符号 4.判断是否超出整数范围，并返回相应的值
python-leetcode面试题解之第125题验证回文串-题解.zip
05-06
本题解集中关注的是LeetCode第125题——"验证回文串"（Valid Palindrome）。这道题目是面试中常见的算法问题，考察了程序员对字符串处理和双指针技巧的掌握。 回文串是指一个字符串从前往后读和从后往前读是一样的...
java-leetcode面试题解之第8题字符串转换整数atoi.zip
03-08
这道题目是LeetCode中的第8题，名为“字符串转换整数 (atoi)”。本题主要考察的是字符串处理和数学转换的能力，特别是将一个可能包含非数字字符的字符串转化为整数。以下是对该题目的详细解析： 首先，我们需要理解...
tesla-peer#LeetCode-Python-#0009. 回文数1
07-25
比如：1221，转换到一半，原数变为 12，转换好的数变为 12，则说明原数就是回文数。如果原数为奇数，比如：12321，转换到一半，原数变为 12，转换好的数
C++实现的报数出圈程序源代码
06-04
以C++方式实现程序：设有N个人围坐一圈并按顺时针方向从 1到N编号，从第S个人开始进行1到M报数，报数到第M个时，此人出圈，再从他的下一个人重新开始1到M的报数，如此进行下去直到所有的人都出圈为止。打印出出圈次序。
leetcode报数题
一位小白的博客
04-18 2391
报数序列是指一个整数序列，按照其中的整数的顺序进行报数，得到下一个数。其前五项如下：1. 1 2. 11 3. 21 4. 1211 5. 111221 1 被读作  "one 1"  ("一个一") , 即 11。11 被读作 "two 1s" ("两个一"）, 即 21。21 被读作 "one 2",  "one 1" （"一个二&qu
C语言经典-报数问题
Aa_Lyang的博客
04-05 6375
题目描述： n个小朋友做游戏，编号从1道n。他们按编号大小从小到大依次顺时针围成一个圈，第一个小朋友开始报1，顺时针方向报数加1，报m的人会离开，下一个小朋友继续报1，直到只剩一个小朋友。 输入： 两个正整数n,m(均不超过1000) 输出： 最后一个小朋友编号 样例输入： 10 5 样例输出： 3 代码： #include <stdio.h> int sz[20]; int n,m; void f(); int main() { scanf("%d %d",&n,&m)
报数问题
R的博客
08-29 2788
注意计数值的初始值 25个人围成一个圈，从第一个人开始顺序报号，凡报号为3和3的倍数者退出圈子，找出最后留在圈子中的人的编号 #include <stdio.h> int main() { int i,k,m,n,num[50],*p; printf("\ninput number of person: n="); scanf("%d",&n); ...
报数退出【笔试编程题】
Marmara
04-12 562
昨天晚上笔试中的题。和大一学C语言遇到过的引约瑟夫问题(猴子选大王)一样的哈哈。以前用数组做的，现在用队列啦，在进步哦哈哈~ 题目要求：有n个人围成一圈，顺序排号。从第一个人开始报数（从1到m报数），凡报到m的人退出圈子，问最后留下的是原来第几号的那位。 package daily; import java.util.HashMap; import java.util.Li...
报数序列是一个整数序列，按照其中的整数的顺序进行报数，得到下一个数。
爷的博客
10-11 1335
其前五项如下： 1. 1 2. 11 3. 21 4. 1211 5. 111221 1 被读作 "one 1" ("一个一") , 即 11。 11 被读作 "two 1s" ("两个一"）, 即 21。 21 被读作 "one 2", "one 1" （"一个二" , "一个一") , 即 121
leetcode 字符串转换整数
06-06
请你来实现一个 atoi 函数，使其能将字符串转换成整数。该函数需要丢弃无用的开头空格，找到第一个非空格字符，然后将其后面的字符（如果符合要求的话）转换成整数，如果第一个非空字符为正或者负号时，将该符号与...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值